The convergence rate of the schwarz alternating procedure (I): For one-dimensional problems

DOI10.1080/00207168608803540zbMath0654.65032OpenAlexW4231955419MaRDI QIDQ3800982

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

Publication date: 1986

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

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

zbMATH Keywords

domain decompositionconvergence rateone-dimensional problemsconvergence factorSchwarz alternating procedurelocal pseudo-boundary

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Linear boundary value problems for ordinary differential equations (34B05)

Related Items (9)

Strategies of domain decomposition for the design of parallel algorithms ⋮ Estimation of the convergence rate of schwarz alternating method and an accelerated algorithm ⋮ 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 ⋮ The convergence rate of the schwarz alternating procedure (VI)—for unsymmetric problems ⋮ The Schwarz alternating method in solid mechanics ⋮ A combined technique for solution of PDE's via the generalized domain decomposition method

Cites Work

• The asynchronous parallel algorithms s-cor for solving p.d.e.'s on multiprocessors

This page was built for publication: The convergence rate of the schwarz alternating procedure (I): For one-dimensional problems