Strategies of domain decomposition for the design of parallel algorithms

DOI10.1080/00207169008803820zbMath0752.65084MaRDI QIDQ4009732

Lishan Kang, David J. Evans

Publication date: 27 September 1992

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

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

zbMATH Keywords

overlapping; domain decomposition method; parallel computers; fictitious components

Mathematics Subject Classification ID

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

65Y05: Parallel numerical computation

65M55: Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs

Related Items

Parallel integration of odes by vector field decompositions, Parallel algorithms for solving Steady Navier-Stokes Equation on CM-5

Cites Work

• Unnamed Item
• An asynchronous parallel mixed algorithm for linear and nonlinear equations
• The convergence factor of the parallel Schwarz overrelaxation method for linear systems
• 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
• 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
• Numerical Implementation of the Schwarz Alternating Procedure for Elliptic Partial Differential Equations