An approximate BDDC preconditioner

The balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each substructure and one linear system for a global coarse problem. The computations and memory needed for these solutions can be prohibitive if any one system is too large. We investigate an approach for addressing this issue based on approximating the direct solutions using preconditioners. In order to retain the attractive numerical properties of the exact version of BDDC, some of the preconditioners must possess a property related to the substructure null spaces. We describe a simple method to equip preconditioners with this property. Numerical results demonstrate the usefulness of the approach and confirm the theory. Published in 2006 by John Wiley & Sons, Ltd.

[1]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[2]  O. Widlund,et al.  On the use of inexact subdomain solvers for BDDC algorithms , 2007 .

[3]  Susanne C. Brenner,et al.  BDDC and FETI-DP without matrices or vectors , 2007 .

[4]  CLARK R. DOHRMANN,et al.  Interpolation Operators for Algebraic Multigrid by Local Optimization , 2007, SIAM J. Sci. Comput..

[5]  X. Tu.  A BDDC ALGORITHM FOR A MIXED FORMULATION OF FLOW IN POROUS MEDIA , 2005 .

[6]  Joseph E. Pasciak,et al.  Analysis of non-overlapping domain decomposition algorithms with inexact solves , 1998, Math. Comput..

[7]  Xuemin Tu,et al.  Three‐level BDDC in two dimensions , 2007 .

[8]  Axel Klawonn,et al.  Inexact FETI‐DP methods , 2007 .

[9]  Olof B. Widlund,et al.  Dual‐primal FETI methods for linear elasticity , 2006 .

[10]  Olof B. Widlund,et al.  DUAL-PRIMAL FETI METHODS FOR THREE-DIMENSIONAL ELLIPTIC PROBLEMS WITH HETEROGENEOUS COEFFICIENTS , 2022 .

[11]  Jan Mandel,et al.  On the convergence of a dual-primal substructuring method , 2000, Numerische Mathematik.

[12]  Arnd Meyer,et al.  The approximate Dirichlet Domain Decomposition method. Part II: Applications to 2nd-order Elliptic B.V.P.s , 2005, Computing.

[13]  C. Farhat,et al.  A scalable dual-primal domain decomposition method , 2000, Numer. Linear Algebra Appl..

[14]  Olof B. Widlund,et al.  A Domain Decomposition Method with Lagrange Multipliers and Inexact Solvers for Linear Elasticity , 2000, SIAM J. Sci. Comput..

[15]  Barry Smith.  A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions , 1993, SIAM J. Sci. Comput..

[16]  Xuemin Tu.  Three-Level BDDC in Three Dimensions , 2007, SIAM J. Sci. Comput..

[17]  Barry F. Smith,et al.  Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[18]  Mark F. Adams.  A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers , 2001, SC.

[19]  J. Mandel,et al.  An algebraic theory for primal and dual substructuring methods by constraints , 2005 .

[20]  Christoph Börgers,et al.  The Neumann-Dirichlet domain decomposition method with inexact solvers on the subdomains , 1989 .

[21]  G. Haasey,et al.  Explicit Extension Operators on Hierarchical Grids , 1998 .

[22]  Olof B. Widlund,et al.  FETI‐DP, BDDC, and block Cholesky methods , 2006 .

[23]  Olof B. Widlund,et al.  BDDC Algorithms for Incompressible Stokes Equations , 2006, SIAM J. Numer. Anal..

[24]  CLARK R. DOHRMANN,et al.  A Preconditioner for Substructuring Based on Constrained Energy Minimization , 2003, SIAM J. Sci. Comput..

[25]  Clark R. Dohrmann,et al.  Convergence of a balancing domain decomposition by constraints and energy minimization , 2002, Numer. Linear Algebra Appl..

[26]  Arnd Meyer,et al.  The approximate Dirichlet Domain Decomposition method. Part I: An algebraic approach , 1991, Computing.