Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms

DOI10.1007/S002110100376zbMATH Open1054.65043OpenAlexW1967581090MaRDI QIDQ1864512FDOQ1864512

Authors: Susanne C. Brenner, Qingmi He 

Publication date: 18 March 2003

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110100376

Recommendations

• Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
• A domain decomposition algorithm for elliptic problems in three dimensions
• Substructuring preconditioners for the three fields domain decomposition method
• scientific article; zbMATH DE number 1218962
• scientific article; zbMATH DE number 218270

zbMATH Keywords

domain decomposition methodsNeumann-Neumann preconditionerbasket preconditioner

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cited In (4)

• Multispace and multilevel BDDC
• BDDC domain decomposition algorithms
• Lower Bounds for Two-Level Additive Schwarz Preconditioners with Small Overlap
• Analysis of FETI methods for multiscale PDEs

This page was built for publication: Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864512)