Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
lower boundscondition numbersnonoverlapping domain decompositionNeumann-Neumann preconditionerBPS-preconditioner
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) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Recommendations
Cites Work
- scientific article; zbMATH DE number 3987790 (Why is no real title available?)
- scientific article; zbMATH DE number 4076515 (Why is no real title available?)
- scientific article; zbMATH DE number 4080828 (Why is no real title available?)
- scientific article; zbMATH DE number 3536702 (Why is no real title available?)
- scientific article; zbMATH DE number 3596197 (Why is no real title available?)
- scientific article; zbMATH DE number 613872 (Why is no real title available?)
- scientific article; zbMATH DE number 626231 (Why is no real title available?)
- scientific article; zbMATH DE number 671790 (Why is no real title available?)
- scientific article; zbMATH DE number 218047 (Why is no real title available?)
- scientific article; zbMATH DE number 749483 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- Multilevel Schwarz methods
- On the abstract theory of additive and multiplicative Schwarz algorithms
- On the spectra of sums of orthogonal projections with applications to parallel computing
- Schwarz methods of neumann‐neumann type for three‐dimensional elliptic finite element problems
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
Cited In (8)
- A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems
- Multispace and multilevel BDDC
- Lower Bounds for Two-Level Additive Schwarz Preconditioners with Small Overlap
- Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms
- A three-level BDDC algorithm for a saddle point problem
- A domain decomposition method using efficient interface-acting preconditioners
- A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems
- Strict lower bounds with separation of sources of error in non-overlapping domain decomposition methods
This page was built for publication: Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501029)