Lower bounds for nonoverlapping domain decomposition preconditioners in two dimensions

DOI10.1090/S0025-5718-00-01236-9zbMATH Open0974.65114OpenAlexW2027541159MaRDI QIDQ4501029FDOQ4501029

Authors:

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

Recommendations

• Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms
• scientific article; zbMATH DE number 1329160
• Lower Bounds for Two-Level Additive Schwarz Preconditioners with Small Overlap
• Analysis of non-overlapping domain decomposition algorithms with inexact solves

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) 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Construction of Preconditioners for Elliptic Problems by Substructuring. I
• Schwarz methods of neumann‐neumann type for three‐dimensional elliptic finite element problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the abstract theory of additive and multiplicative Schwarz algorithms
• On the spectra of sums of orthogonal projections with applications to parallel computing
• Multilevel Schwarz methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)