Adaptive data distribution for concurrent continuation.
We consider a general abstract framework of a continuous elliptic problem set on a Hilbert space V that is approximated by a family of (discrete) problems set on a finite-dimensional space of finite dimension not necessarily included into V. We give a series of realistic conditions on an error estimator that allows to conclude that the marking strategy of bulk type leads to the geometric convergence of the adaptive algorithm. These conditions are then verified for different concrete problems...
In this paper we propose and analyze stable variational formulations for convection diffusion problems starting from concepts introduced by Sangalli. We derive efficient and reliable a posteriori error estimators that are based on these formulations. The analysis of resulting adaptive solution concepts, when specialized to the setting suggested by Sangalli’s work, reveals partly unexpected phenomena related to the specific nature of the norms induced by the variational formulation. Several remedies,...
In this paper we propose and analyze stable variational formulations for convection diffusion problems starting from concepts introduced by Sangalli. We derive efficient and reliable a posteriori error estimators that are based on these formulations. The analysis of resulting adaptive solution concepts, when specialized to the setting suggested by Sangalli’s work, reveals partly unexpected phenomena related to the specific nature of the norms induced by the variational formulation. Several remedies,...
An iterative procedure containing two parameters for solving linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numerical example is given as an illustration.
We generalize the overlapping Schwarz domain decomposition method to problems of linear elasticity. The convergence rate independent of the mesh size, coarse-space size, Korn’s constant and essential boundary conditions is proved here. Abstract convergence bounds developed here can be used for an analysis of the method applied to singular perturbations of other elliptic problems.
The optimization of functions subject to partial differential equations (PDE) plays an important role in many areas of science and industry. In this paper we introduce the basic concepts of PDE-constrained optimization and show how the all-at-once approach will lead to linear systems in saddle point form. We will discuss implementation details and different boundary conditions. We then show how these system can be solved efficiently and discuss methods and preconditioners also in the case when bound...