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… Expand
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 aExpand
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. Expand
An adaptive BDDC algorithm in variational form for mortar discretizations
A balancing domain decomposition by constraints (BDDC) algorithm with adaptive primal constraints in variational form is introduced and analyzed for high-order mortar discretization ofExpand
Adaptive BDDC algorithms for the system arising from plane wave discretization of Helmholtz equations
Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS)Expand
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. Expand
Scalable solvers for complex electromagnetics problems
TLDR
The new method, in contrast to existing approaches for problems in curl-conforming spaces does not require spectral information whilst providing robustness with regard to coefficient jumps and heterogeneous materials, shows excellent weak scalability properties of the implementation of the proposed algorithms. Expand
Block FETI-DP/BDDC preconditioners for mixed isogeometric discretizations of three-dimensional almost incompressible elasticity
TLDR
A block FETI–DP/BDDC preconditioner for mixed formulations of almost incompressible elasticity is constructed and analyzed; of particular interest is the development of variants of the algorithm with a coarse component of small dimension. Expand
Isogeometric BDDC deluxe preconditioners for linear elasticity
Balancing Domain Decomposition by Constraints (BDDC) preconditioners have been shown to provide rapidly convergent preconditioned conjugate gradient methods for solving many of the veryExpand
A frugal FETI-DP and BDDC coarse space for heterogeneous problems
TLDR
A new frugal coarse space for FETI-DP and BDDC (Balancing Domain Decomposition by Constraints) methods is presented, which has a lower set-up cost than competing adaptive coarse spaces and is robust for a broad range of coefficient distributions for diffusion and elasticity problems. Expand
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 99 REFERENCES
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 inExpand
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 aExpand
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. Expand
An Overlapping Schwarz Algorithm for Raviart-Thomas Vector Fields with Discontinuous Coefficients
  • Duk-Soon Oh
  • Computer Science, Mathematics
  • SIAM J. Numer. Anal.
  • 2013
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. Expand
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 contrastExpand
Three-Level BDDC in Three Dimensions
  • X. Tu
  • Mathematics, 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. Expand
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. Expand
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. Expand
Three‐level BDDC in two dimensions
Balancing Domain Decomposition by Constraints (BDDC) methods are non-overlapping iterative substructuring domain decomposition methods for the solution of large sparse linear algebraic systemsExpand
Convergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems
  • Jing Li, X. Tu
  • Mathematics, Computer Science
  • Numer. Linear Algebra Appl.
  • 2009
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 solvingExpand
...
1
2
3
4
5
...