An Iterative Substructuring Method for Raviart-Thomas Vector Fields in Three Dimensions

@article{Wohlmuth2000AnIS,
  title={An Iterative Substructuring Method for Raviart-Thomas Vector Fields in Three Dimensions},
  author={Barbara I. Wohlmuth and Andrea Toselli and Olof B. Widlund},
  journal={SIAM J. Numer. Anal.},
  year={2000},
  volume={37},
  pages={1657-1676}
}
The iterative substructuring methods, also known as Schur complement methods, form one of two important families of domain decomposition algorithms. They are based on a partitioning of a given region, on which the partial differential equation is defined, into nonoverlapping substructures. The preconditioners of these conjugate gradient methods are then given in terms of local problems, defined on individual substructures and pairs of substructures, and, in addition, a global problem of low… 
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.
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
An Overlapping Schwarz Algorithm for Raviart-Thomas Vector Fields with Discontinuous Coefficients
TLDR
A two-level overlapping Schwarz method for Raviart--Thomas vector fields is developed and analyzed and gives a condition number bound which depends only on the size of the local subproblems.
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.
Domain Decomposition Methods for Raviart-Thomas Vector Fields
TLDR
Two domain decomposition methods for solving vector field problems posed in H(div) discretized by Raviart-Thomas finite elements are introduced and a two-level overlapping Schwarz method is developed.
An Alternative Coarse Space Method for Overlapping Schwarz Preconditioners for Raviart-Thomas Vector Fields
  • Duk-Soon Oh
  • Computer Science
    Domain Decomposition Methods in Science and Engineering XX
  • 2013
TLDR
An overlapping Schwarz method for vector field problems discretized with the lowest order Raviart-Thomas finite elements with a couple of benefits compared to the previous methods.
Neumann-Neumann Methods for Vector Field Problems
In this paper, we study some Schwarz methods of Neumann-Neumann type for some vector field problems, discretized with the lowest order Raviart-Thomas and Nedelec finite elements. We consider a hybrid
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.
Dual-primal FETI algorithms for edge finite-element approximations in 3D
TLDR
A family of dual-primal finite-element tearing and interconnecting methods for edge-element approximations in 3D is proposed and analysed and a strong coupling between degrees of freedom associated with subdomain edges and faces is relied on.
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
...
...

References

SHOWING 1-10 OF 32 REFERENCES
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.
Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems, part I: Algorithms and numerical results
TLDR
Sequential and parallel algorithms based on the Schwarz alternating method for the solution of mixed finite element discretizations of elliptic problems using the Raviart-Thomas finite element spaces lead to symmetric indefinite linear systems.
Nonstandard coarse spaces and Schwarz methods for elliptic problems with discontinuous coefficients using non-conforming elements
Summary.Two-level domain decomposition methods are developed for a simple nonconforming approximation of second order elliptic problems. A bound is established for the condition number of these
PRECONDITIONING IN H (div) AND APPLICATIONS
TLDR
These preconditioners are shown to be spectrally equivalent to the inverse of the operator and may be used to preconditions iterative methods so that any given error reduction may be achieved in a finite number of iterations, with the number independent of the mesh discretization.
Overlapping Schwarz methods for Maxwell's equations in three dimensions
  • A. Toselli
  • Computer Science
    Numerische Mathematik
  • 2000
TLDR
A two-level overlapping Schwarz method is considered for a Nédélec finite element approximation of 3D Maxwell's equations, generalizing well–known results for conforming finite elements for second order elliptic scalar equations.
A multigrid algorithm for the lowest-order Raviart-Thomas mixed triangular finite element method
An optimal order multigrid method for the lowest-order Raviart–Thomas mixed triangular finite element is developed. The algorithm and the convergence analysis are based on the equivalence between
Multigrid in H (div) and H (curl)
TLDR
If appropriate finite element spaces and appropriate additive or multiplicative Schwarz smoothers are used, then the multigrid V-cycle is an efficient solver and preconditioner for the discrete operator.
An optimal domain decomposition preconditioner for low-frequency time-harmonic Maxwell equations
TLDR
An iteration-by-subdomain procedure is proven to converge, showing that the preconditioner implicitly defined by the iterative procedure is optimal, and proving a regularity theorem for Dirichlet and Neumann harmonic fields.
Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions
Domain decomposition methods provide powerful preconditioners for the iterative solution of the large systems of algebraic equations that arise in finite element or finite difference approximations...
Overlapping and Multilevel Schwarz Methods for Vector Valued Elliptic Problems in Three Dimensions
This paper is intended as a survey of current results on algorithmic and theoretical aspects of overlapping Schwarz methods for discrete H(curl;Ω) and H(div;Ω)-elliptic problems set in suitable
...
...