The convergence rate of the schwarz alternating procedure (iv): with pseudo-boundary relaxation factor

DOI10.1080/00207168708803565zbMath0655.65052OpenAlexW2082164081MaRDI QIDQ3802491

Lishan Kang, Yuping Chen, Jianping Shao, David J. Evans

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803565

zbMATH Keywords

domain decompositionHelmholtz equationSchwarz alternating procedureconvergence rangemaximum convergence factoroptimal overrelaxation factorpseudo-boundary overrelaxation

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (5)

Parallel schwarz algorithm with under-relaxed pseudo boundary conditions in domain decomposition method ⋮ Strategies of domain decomposition for the design of parallel algorithms ⋮ The convergence rate of the schwarz alternating procedure (v)—for more than two subdomains ⋮ The convergence rate of the schwarz alternating procedure (VI)—for unsymmetric problems ⋮ Multi-parameterized Schwarz alternating methods for elliptic boundary value problems.

Cites Work

• The asynchronous parallel algorithms s-cor for solving p.d.e.'s on multiprocessors
• The convergence rate of the schwarz alternating procedure (I): For one-dimensional problems
• The convergence rate of the schwarz alternating procedure (II)—for two-dimensional problems

This page was built for publication: The convergence rate of the schwarz alternating procedure (iv): with pseudo-boundary relaxation factor