Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Applied numerical linear algebra
Applied numerical linear algebra
A Neumann--Neumann Domain Decomposition Algorithm for Solving Plate and Shell Problems
SIAM Journal on Numerical Analysis
A Scalable Substructuring Method by Lagrange Multipliers for Plate Bending Problems
SIAM Journal on Numerical Analysis
SIAM Journal on Scientific Computing
Dual-Primal FETI Methods for Three-Dimensional Elliptic Problems with Heterogeneous Coefficients
SIAM Journal on Numerical Analysis
An Iterative Method with Convergence Rate Chosen a priori
An Iterative Method with Convergence Rate Chosen a priori
A Preconditioner for Substructuring Based on Constrained Energy Minimization
SIAM Journal on Scientific Computing
Domain Decomposition Methods for Distributed Computing
Domain Decomposition Methods for Distributed Computing
SIAM Journal on Scientific Computing
An Analysis of a FETI-DP Algorithm on Irregular Subdomains in the Plane
SIAM Journal on Numerical Analysis
Analysis of FETI methods for multiscale PDEs
Numerische Mathematik
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
BDDC by a frontal solver and the stress computation in a hip joint replacement
Mathematics and Computers in Simulation
Analysis of FETI methods for multiscale PDEs. Part II: interface variation
Numerische Mathematik
Original article: Face-based selection of corners in 3D substructuring
Mathematics and Computers in Simulation
Hi-index | 0.00 |
Abstract: 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 variables. The effectiveness of the method is illustrated on several engineering problems.