Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions

DOI10.1090/S0025-5718-00-01236-9zbMath0974.65114OpenAlexW2027541159MaRDI QIDQ4501029

No author found.

Publication date: 3 September 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01236-9

zbMATH Keywords

lower boundscondition numbersnonoverlapping domain decompositionNeumann-Neumann preconditionerBPS-preconditioner

Mathematics Subject Classification ID

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

Related Items

A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems, A three-level BDDC algorithm for a saddle point problem, A domain decomposition method using efficient interface-acting preconditioners, Multispace and multilevel BDDC

Cites Work

• 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
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I
• Schwarz methods of neumann‐neumann type for three‐dimensional elliptic finite element problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item