Residual based a posteriori error estimators for eddy current computation
We consider H(curl;Ω)-elliptic problems that have been discretized by means of Nédélec's edge elements on tetrahedral meshes. Such problems occur in the numerical computation of eddy currents. From the defect equation we derive localized expressions that can be used as a posteriori error estimators to control adaptive refinement. Under certain assumptions on material parameters and computational domains, we derive local lower bounds and a global upper bound for the total error measured in...
This paper introduces the application of asynchronous iterations theory within the framework of the primal Schur domain decomposition method. A suitable relaxation scheme is designed, whose asynchronous convergence is established under classical spectral radius conditions. For the usual case where local Schur complement matrices are not constructed, suitable splittings based only on explicitly generated matrices are provided. Numerical experiments are conducted on a supercomputer for both Poisson's...
This article discusses the numerical approximation of time dependent Ginzburg-Landau equations. Optimal error estimates which are robust with respect to a large Ginzburg-Landau parameter are established for a semi-discrete in time and a fully discrete approximation scheme. The proofs rely on an asymptotic expansion of the exact solution and a stability result for degree-one Ginzburg-Landau vortices. The error bounds prove that degree-one vortices can be approximated robustly while unstable higher...
This article discusses the numerical approximation of time dependent Ginzburg-Landau equations. Optimal error estimates which are robust with respect to a large Ginzburg-Landau parameter are established for a semi-discrete in time and a fully discrete approximation scheme. The proofs rely on an asymptotic expansion of the exact solution and a stability result for degree-one Ginzburg-Landau vortices. The error bounds prove that degree-one vortices can be approximated robustly while unstable higher...
An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into “local” subspaces and a global “coarse” space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function formulation of its mixed form, Stokes’ and Brinkman’s equations. The constant in the corresponding abstract...
An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into “local” subspaces and a global “coarse” space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function formulation of its mixed form, Stokes’ and Brinkman’s equations....
Singularly perturbed problems often yield solutions with strong directional features, e.g. with boundary layers. Such anisotropic solutions lend themselves to adapted, anisotropic discretizations. The quality of the corresponding numerical solution is a key issue in any computational simulation. To this end we present a new robust error estimator for a singularly perturbed reaction–diffusion problem. In contrast to conventional estimators, our proposal is suitable for anisotropic finite element...
Singularly perturbed problems often yield solutions with strong directional features, e.g. with boundary layers. Such anisotropic solutions lend themselves to adapted, anisotropic discretizations. The quality of the corresponding numerical solution is a key issue in any computational simulation. To this end we present a new robust error estimator for a singularly perturbed reaction-diffusion problem. In contrast to conventional estimators, our proposal is suitable for anisotropic finite element...
We discuss a family of discontinuous Petrov–Galerkin (DPG) schemes for quite general partial differential operators. The starting point of our analysis is the DPG method introduced by [Demkowicz et al., SIAM J. Numer. Anal. 49 (2011) 1788–1809; Zitelli et al., J. Comput. Phys. 230 (2011) 2406–2432]. This discretization results in a sparse positive definite linear algebraic system which can be obtained from a saddle point problem by an element-wise Schur complement reduction applied to the test space....
While a large amount of papers are dealing with robust multilevel methods and algorithms for linear FEM elliptic systems, the related higher order FEM problems are much less studied. Moreover, we know that the standard hierarchical basis two-level splittings deteriorate for strongly anisotropic problems. A first robust multilevel preconditioner for higher order FEM systems obtained after discretizations of elliptic problems with an anisotropic diffusion tensor is presented in this paper. We study...