Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms
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) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
The authors show that the known upper bounds of the wire basket preconditioner and the Neumann-Neumann preconditioner in three dimensions for nonoverlapping domain decomposition algorithms are sharp. The proof for the wire basket preconditioner is based on finding that the upper bound of \(\lambda_{\min}\) is of the same order than the known lower bound, and the lower bound of \(\lambda_{\max}\) is \(1\). Then, the condition number for this preconditioner is bounded below and above for the same quantity. The same procedure follows for the Neumann-Neumann preconditioner where in this case \(1\) is an upper bound of \(\lambda_{\min}\), and the lower bound of \(\lambda_{\max}\) is of the same order than the known upper bound.
- 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
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)
