COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE

DOI10.1142/S0129053389000020zbMATH Open0726.65029OpenAlexW2160642571MaRDI QIDQ3350657FDOQ3350657

Authors: Zhiqiang Cai, S. F. McCormick 

Publication date: 1989

Published in: International Journal of High Speed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129053389000020

Recommendations

• The convergence rate of the schwarz alternating procedure (v)—for more than two subdomains
• The convergence rate of the schwarz alternating procedure (I): For one-dimensional problems
• Two parallel SOR variants of the Schwarz alternating procedure
• The convergence rate of the schwarz alternating procedure (II)—for two-dimensional problems
• scientific article; zbMATH DE number 4111951

zbMATH Keywords

complexitydomain decompositionparallel computationmultigridPoisson problemSchwarz alternating proceduresharp convergence rate estimates

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)

Cited In (6)

• Error estimates for a Schwarz alternating procedure on L-shaped regions
• A refinement of Cauchy-Schwarz complexity
• The Numerical Schwarz Alternating Procedure and SOR
• Norm estimates of product operators with application to domain decomposition
• Two parallel SOR variants of the Schwarz alternating procedure
• Title not available (Why is that?)

This page was built for publication: COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE

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