Parallel schwarz algorithm with under-relaxed pseudo boundary conditions in domain decomposition method

DOI10.1080/00207169308804203MaRDI QIDQ4285654zbMATH OpenOpenAlexFDO

Authors YongHee Kim, Nam Zin Cho

Publication date 31 July 1994

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

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

zbMATH Keywords

convergencenumerical experimentsdomain decompositionparallel Schwarz algorithmunder-relaxationpseudo-boundary conditions

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Recommendations

• Publication:3030183
• scientific article; zbMATH DE number 1131757
• scientific article; zbMATH DE number 1113871
• scientific article; zbMATH DE number 569937
• Analysis of a parallel Schwarz algorithm for elliptic problems

Cites work

• scientific article; zbMATH DE number 3257779 (Why is no real title available?)
• The convergence rate of the schwarz alternating procedure (iv): with pseudo-boundary relaxation factor

This page was built for publication: Parallel schwarz algorithm with under-relaxed pseudo boundary conditions in domain decomposition method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285654)