BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

@article{Oh2018BDDCAW,
  title={BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields},
  author={Duk-Soon Oh and Olof B. Widlund and Stefano Zampini and Clark R. Dohrmann},
  journal={Math. Comput.},
  year={2018},
  volume={87},
  pages={659-692}
}
A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a new type of weighted average and an adaptive selection of primal constraints developed to deal with… 

Figures and Tables from this paper

An adaptive choice of primal constrains for BDDC domain decomposition algorithms

An adaptive choice based on parallel sums for the primal space of BDDC [1] deluxe methods [2] is analyzed. The primal constraints of a BDDC algorithm provide the global, coarse part of such a

On the Robustness and Prospects of Adaptive BDDC Methods for Finite Element Discretizations of Elliptic PDEs with High-Contrast Coefficients

TLDR
An exposition of the BDDC algorithm is presented that identifies the current computational bottlenecks that could prevent it from being competitive with other solvers, and proposes solutions in anticipation of exascale architectures.

An adaptive BDDC algorithm in variational form for mortar discretizations

Adaptive Selection of Primal Constraints for Isogeometric BDDC Deluxe Preconditioners

TLDR
Several adaptive algorithms are developed in this paper for scalar elliptic problems in an effort to decrease the dimension of the global, coarse component of these preconditioners of the BDDC family of domain decomposition algorithms.

Adaptive BDDC algorithms for the system arising from plane wave discretization of Helmholtz equations

TLDR
A two‐level adaptive balancing domain decomposition by constraints algorithm for the plane wave least‐squares discretization, and the condition number of the preconditioned system is proved to be bounded above by a user‐defined tolerance and a constant that is only dependent on the maximum number of interfaces per subdomain.

BDDC preconditioners for divergence free virtual element discretizations of the Stokes equations

TLDR
The aim of this article is to extend the balancing domain decomposition by constraints preconditioner to the solution of the saddle-point linear system arising from a VEM discretization of the two-dimensional Stokes equations.

Scalable solvers for complex electromagnetics problems

Isogeometric BDDC deluxe preconditioners for linear elasticity

TLDR
The theory of Balancing Domain Decomposition by Constraints is extended to problems of linear elasticity in three dimensions, previously fully developed only for scalar elliptic problems in the plane.

Adaptive Coarse Spaces for FETI-DP in Three Dimensions

TLDR
The introduction of the edge eigenvalue problems thus turns a well-known condition number indicator for FETI-DP and balancing domain decomposition by constraints (BDDC) methods into a condition number estimate.

Adaptive FETI-DP and BDDC methods with a generalized transformation of basis for heterogeneous problems

TLDR
The recently established theory of a generalized transformation-of-basis approach yields a condition number estimate for the preconditioned operator that is independent of jumps of the coefficients across and inside subdomains when using the local adaptive constraints.
...

References

SHOWING 1-10 OF 99 REFERENCES

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 adaptive choice of primal constrains for BDDC domain decomposition algorithms

An adaptive choice based on parallel sums for the primal space of BDDC [1] deluxe methods [2] is analyzed. The primal constraints of a BDDC algorithm provide the global, coarse part of such a

BDDC Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions

TLDR
The condition number of the BDDC preconditioned operator is shown to depend only weakly on the polynomial degree, the ratio of subdomain and element diameters, and the inverse of the inf-sup constants of the subdomains and the underlying mixed formulation, while being scalable and robust.

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 BDDC Algorithm with Enriched Coarse Spaces for Two-Dimensional Elliptic Problems with Oscillatory and High Contrast Coefficients

A balancing domain decomposition by constraints (BDDC) algorithm with enriched coarse spaces is developed and analyzed for two-dimensional elliptic problems with oscillatory and high contrast

Three-Level BDDC in Three Dimensions

  • X. Tu
  • Computer Science
    SIAM J. Sci. Comput.
  • 2007
TLDR
Two three-level BDDC methods are introduced for solving the coarse problem approximately for problems in three dimensions, an extension of previous work for the two-dimensional case.

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

TLDR
The algorithm can be implemented in an algebraic manner that does not require access to individual subdomain matrices or a coarse discretization of the domain, and favorable condition number bounds can be established over a broader range of subdomain material properties than in previous studies.

Adaptive Selection of Primal Constraints for Isogeometric BDDC Deluxe Preconditioners

TLDR
Several adaptive algorithms are developed in this paper for scalar elliptic problems in an effort to decrease the dimension of the global, coarse component of these preconditioners of the BDDC family of domain decomposition algorithms.

Convergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems

A variant of balancing domain decomposition method by constraints (BDDC) is proposed for solving a class of indefinite systems of linear equations of the form (K−σ2M)u=f, which arise from solving

Three‐level BDDC in two dimensions

  • X. Tu
  • Mathematics, Computer Science
  • 2007
TLDR
Two three‐level BDDC methods are introduced for solving the coarse problem approximately in two‐dimensional space, while still maintaining a good convergence rate.
...