The convergence rate of the schwarz alternating procedure (VI)—for unsymmetric problems

DOI10.1080/00207168808803667zbMath0655.65054OpenAlexW1969458127MaRDI QIDQ3802493

Jianping Shao, Lishan Kang, Yuping Chen

Publication date: 1988

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

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

zbMATH Keywords

domain decompositionconvergence ratepseudo-boundarySchwarz alternating procedurethird boundary value conditionsunsymmetric problems

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (1)

Strategies of domain decomposition for the design of parallel algorithms

Cites Work

• 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
• The convergence rate of the schwarz alternating procedure (iii)—for neumann problems
• The convergence rate of the schwarz alternating procedure (iv): with pseudo-boundary relaxation factor
• The convergence rate of the schwarz alternating procedure (v)—for more than two subdomains

This page was built for publication: The convergence rate of the schwarz alternating procedure (VI)—for unsymmetric problems