<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="https://puma.ub.uni-stuttgart.de/group/simtech/adaptivity"><owl:Ontology rdf:about=""><rdfs:comment>PUMA publications for /group/simtech/adaptivity</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/28fc4612e68ea6905b965ae8c7e92e656/mhartmann"><owl:sameAs rdf:resource="/uri/bibtex/28fc4612e68ea6905b965ae8c7e92e656/mhartmann"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://imajna.oxfordjournals.org/content/31/3/947.abstract"/><swrc:date>Fri Jul 20 10:54:15 CEST 2018</swrc:date><swrc:journal>IMA Journal of Numerical Analysis</swrc:journal><swrc:number>3</swrc:number><swrc:pages>947-970</swrc:pages><swrc:title>A Convergence Proof for Adaptive Finite Elements without Lower Bound</swrc:title><swrc:volume>31</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>adaptivity convergence elements finite density vorlaeufig </swrc:keywords><swrc:abstract>We analyse the adaptive finite-element approximation to solutions
	of partial differential equations in variational formulation. Assuming
	well-posedness of the continuous problem and requiring only basic
	properties of the adaptive algorithm, we prove convergence of the
	sequence of discrete solutions to the true one. The proof is based
	on the ideas by Morin, Siebert and Veeser but replaces local efficiency
	of the estimator by a local density property of the adaptively generated
	finite-element spaces. As a result, estimators without a discrete
	lower bound are also included in our theory. The assumptions of the
	presented framework are fulfilled by a large class of important applications,
	estimators and adaptive strategies.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="kohlsk" swrc:key="owner"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kunibert G. Siebert"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="https://puma.ub.uni-stuttgart.de/bibtex/2a0a427181d0ec9808c9f1ed14dea7246/mhartmann"><owl:sameAs rdf:resource="/uri/bibtex/2a0a427181d0ec9808c9f1ed14dea7246/mhartmann"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/pii/S0021999112007565"/><swrc:date>Fri Jul 20 10:54:15 CEST 2018</swrc:date><swrc:journal>Journal of Computational Physics</swrc:journal><swrc:pages>268-283</swrc:pages><swrc:title>A fast and accurate adaptive solution strategy for two-scale models
	with continuous inter-scale dependencies</swrc:title><swrc:volume>240</swrc:volume><swrc:year>2013</swrc:year><swrc:keywords>Adaptivity vorlaeufig </swrc:keywords><swrc:abstract>This article presents a fast and accurate adaptive algorithm that
	numerically solves a two-scale model with continuous inter-scale
	dependencies. The examined sample two-scale model describes a phase
	transition of a binary mixture with the evolution of equiaxed dendritic
	microstructures. It consists of a macroscopic heat equation and a
	family of microscopic cell problems that model the phase transition
	of the mixture. Both scales are coupled: the macroscopic temperature
	field influences the evolution of the microstructure and the microscopic
	fields enter to the macroscopic heat equation via averaged coefficients.
	Adaptivity exploits the constitutive assumption that the evolving
	microstructure depends in a continuous way on the macroscopic temperature
	field: macroscopic nodes with similar temperature evolutions use
	the same microscopic data. A suitable metric compares temperature
	evolutions and adaptive methods select active macroscopic nodes.
	Microscopic cell problems are solved for active nodes only; microscopic
	data in inactive nodes is approximated from microscopic data of active
	nodes with a similar temperature evolution. The set of active nodes
	is updated in course of the simulation: active nodes are deactivated
	until all active nodes have unsimilar temperature evolutions, and
	inactive nodes are activated until for every inactive node there
	exists at least one active node with a similar temperature evolution.
	Numerical examples, in two and in three space dimensions, show that
	the adaptive solution is only slightly less accurate than the direct
	solution, but it is computationally much more efficient. Therefore,
	the adaptive algorithm enables the solution of two-scale models with
	continuous inter-scale dependencies on large computational macroscopic
	and microscopic grids within an acceptable period of time for computation.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="0021-9991" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="redeker" swrc:key="owner"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1016/j.jcp.2012.12.025" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Magnus Redeker"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Christof Eck"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>