An Iterative Substructuring Algorithm for Two-Dimensional Problems in H(curl)

@article{Dohrmann2012AnIS,
  title={An Iterative Substructuring Algorithm for Two-Dimensional Problems in H(curl)},
  author={Clark R. Dohrmann and Olof B. Widlund},
  journal={SIAM J. Numer. Anal.},
  year={2012},
  volume={50},
  pages={1004-1028}
}
A domain decomposition algorithm, similar to classical iterative substructuring algorithms, is presented for two-dimensional problems in the space $H_0(\mbox{curl};\Omega)$. It is defined in terms of a coarse space and local subspaces associated with individual edges of the subdomains into which the domain of the problem has been subdivided. The algorithm differs from others in three basic respects. First, it can be implemented in an algebraic manner that does not require access to individual… 
A new coarse space for overlapping Schwarz algorithms for H(curl) problems in three dimensions with irregular subdomains
  • J. G. Calvo
  • Mathematics, Computer Science
    Numerical Algorithms
  • 2019
TLDR
A new coarse space for a two-level overlapping Schwarz algorithm for problems posed in three dimensions in the space H ( curl, Ω) is presented and appears very promising even for random and discontinuous values of the coefficients.
On the Design of Small Coarse Spaces for Domain Decomposition Algorithms
TLDR
An analysis for scalar elliptic and linear elasticity problems reveals that significant reductions in the coarse space dimension can be achieved while not sacrificing the favorable condition number estimates for larger coarse spaces previously developed.
An Alternative Coarse Space for Irregular Subdomains and an Overlapping Schwarz Algorithm for Scalar Elliptic Problems in the Plane
TLDR
A condition number bound proportional to $(1+\log(H/h))^2(1+H/\delta)$ was established assuming only that the subdomains are John domains and the rate of convergence was related to a parameter in an isoperimetric inequality for theSubdomains into which the domain of the problem has been partitioned.
Domain Decomposition Methods for Raviart-Thomas Vector Fields
Raviart-Thomas finite elements are very useful for problems posed in H(div) since they are H(div)-conforming. We introduce two domain decomposition methods for solving vector field problems posed in
A BDDC Algorithm for Raviart-Thomas Vector Fields.
A BDDC preconditioner is defined by a coarse component, expressed in terms of primal constraints and a weighted average across the interface between the subdomains, and local components given in
A two-level overlapping Schwarz method for H(curl) in two dimensions with irregular subdomains
A bound is obtained for the condition number of a two-level overlapping Schwarz algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be John subdomains.
BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
TLDR
BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains are presented.
TWO-LEVEL OVERLAPPING SCHWARZ METHOD FOR H ( CURL ) IN 2 D FOR IRREGULAR SUBDOMAINS
A bound is obtained for the condition number of a two-level overlapping Schwarz algorithm for problems posed in H(curl) in 2D, where the subdomains are only assumed to be uniform in the sense of
A BDDC algorithm with deluxe scaling for H(curl) in two dimensions with irregular subdomains
  • J. G. Calvo
  • Mathematics, Computer Science
    Math. Comput.
  • 2016
TLDR
A bound is obtained for the condition number of a BDDC algorithm for problems posed in H(curl) in two dimensions, where the subdomains are only assumed to be uniform in the sense of Peter Jones, and a new technique named deluxe scaling is used.
Domain Decomposition Methods for Problems in H(curl)
TLDR
Two domain decomposition methods for solving vector field problems posed in H(curl) and discretized with Nédélec finite elements are considered, and it is established that the algorithms are scalable.
...
1
2
3
4
...

References

SHOWING 1-10 OF 41 REFERENCES
An Analysis of a FETI-DP Algorithm on Irregular Subdomains in the Plane
TLDR
Borders are derived for the condition number of these preconditioned conjugate gradient methods which depend only on a parameter in an isoperimetric inequality, two geometric parameters characterizing John and uniform domains, and the maximum number of edges of any subdomain.
Domain Decomposition for Less Regular Subdomains: Overlapping Schwarz in Two Dimensions
TLDR
In this study, extensions to the existing theory which accommodate subdomains with much less regular shapes are presented and it is shown that the condition number of the domain decomposition method is bounded by $C(1+H/\delta)(1+\log(H/h))^2$, where the constant C is independent of the number of subDomains and possible jumps in coefficients betweenSubdomains.
An iterative substructuring method for Maxwell's equations in two dimensions
TLDR
The same result is established for similar iterative methods for low--order N{\''e}d{\'' e}lec finite elements, which approximate $\Hcurl$ in two dimensions.
Domain Decomposition Methods for Raviart-Thomas Vector Fields
Raviart-Thomas finite elements are very useful for problems posed in H(div) since they are H(div)-conforming. We introduce two domain decomposition methods for solving vector field problems posed in
An Overlapping Schwarz Algorithm for Almost Incompressible Elasticity
TLDR
Overlapping Schwarz methods are extended to mixed finite element approximations of linear elasticity which use discontinuous pressure spaces and a bound is established for the condition number of the algorithm which grows in proportion to the logarithm of the number of degrees of freedom in individual subdomains.
Hybrid domain decomposition algorithms for compressible and almost incompressible elasticity
Overlapping Schwarz methods are considered for mixed finite element approximations of linear elasticity, with discontinuous pressure spaces, as well as for compressible elasticity approximated by
A family of energy minimizing coarse spaces for overlapping schwarz preconditioners
A simple and effective approach is presented to construct coarse spaces for overlapping Schwarz preconditioners. The approach is based on energy minimizing extensions of coarse trace spaces, and can
Dual-primal FETI algorithms for edge finite-element approximations in 3D
A family of dual-primal finite-element tearing and interconnecting methods for edge-element approximations in 3D is proposed and analysed. The key part of this work relies on the observation that for
A FETI Domain Decomposition Method for Edge Element Approximations in Two Dimensions with Discontinuous Coefficients
TLDR
A class of finite element tearing and interconnecting (FETI) methods for the edge element approximation of vector field problems in two dimensions is introduced and analyzed and it is shown that the condition number of the corresponding method is independent of the number of substructures and grows only polylogarithmically with theNumber of unknowns associated with individual substructure.
Nodal Auxiliary Space Preconditioning in H(curl) and H(div) Spaces
TLDR
This paper develops and analyzes a general approach to preconditioning linear systems of equations arising from conforming finite element discretizations of H(curl, )- and H(div,)-elliptic variational problems and proves mesh-independent effectivity of the precondITIONers by using the abstract theory of auxiliary space preconditionsing.
...
1
2
3
4
5
...