COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE

DOI10.1142/S0129053389000020zbMath0726.65029OpenAlexW2160642571MaRDI QIDQ3350657

Zhi-qiang Cai, Stephen 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

zbMATH Keywords

complexitydomain decompositionparallel computationmultigridPoisson problemSchwarz alternating proceduresharp convergence rate estimates

Mathematics Subject Classification ID

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) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Norm estimates of product operators with application to domain decomposition

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