A Preconditioner for Substructuring Based on Constrained Energy Minimization
SIAM Journal on Scientific Computing
Algebraic Multigrid Based on Computational Molecules, 2: Linear Elasticity Problems
SIAM Journal on Scientific Computing
Multispace and multilevel BDDC
Computing
An algebraic theory for primal and dual substructuring methods by constraints
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Preconditioning of Boundary Value Problems Using Elementwise Schur Complements
SIAM Journal on Matrix Analysis and Applications
BDDC by a frontal solver and the stress computation in a hip joint replacement
Mathematics and Computers in Simulation
| Hi-index | 0.00 |
The method of balanced domain decomposition by constraints is an iterative algorithm for numerical solution of partial differential equations which exploits a non-overlapping partition of a domain. As an essential part of each step, restricted problems are solved on every subdomain and a certain coarse grid solution is found. In this paper we present a new strategy of preconditioning of the coarse problem. This is based on the algebraic multilevel preconditioning technique. We present numerical estimates of constants defining the condition numbers of the preconditioned coarse problems for several two- and three-dimensional elliptic equations.