Three-Level BDDC in Three Dimensions
نویسندگان
چکیده
منابع مشابه
Adaptive BDDC in three dimensions
The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of ...
متن کاملThree-level BDDC
BDDC (Balancing Domain Decomposition by Constraints) methods, so far developed for two levels [3, 7, 8], are similar to the balancing Neumann-Neumann algorithms. However, the BDDC coarse problem is given in terms of a set of primal constraints and the matrix of the coarse problem is generated and factored by direct solvers at the beginning of the computation. The coarse component of the precond...
متن کاملA Three-Level BDDC Algorithm for Mortar Discretizations
In this talk, three-level BDDC algorithms will be presented for the solutions of large sparse linear algebraic systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In the algorithms, the large coarse problems from two-level BDDC algorithms are solved approximately while a...
متن کاملA three-level BDDC algorithm for a saddle point problem
Abstract BDDCalgorithms have previously been extended to the saddle point problems arising frommixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generat...
متن کاملA Three-level Bddc Algorithm for Saddle Point Problems
BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2007
ISSN: 1064-8275,1095-7197
DOI: 10.1137/050629902