Parallel Performance of Domain-Decomposed Preconditioned Krylov Methods for PDE<scp>s</scp>with Locally Uniform Refinement

DOI10.1137/0913008zbMath0752.65083OpenAlexW2023880860MaRDI QIDQ3990908

David E. Keyes, William D. Gropp

Publication date: 28 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0913008

zbMATH Keywords

computational complexitydomain decompositionnumerical experimentsconvection-diffusion problemsiterative methodsparallel computingconvergence rateboundary layerslocal mesh refinementgeneralized minimal residualconjugate gradient squaredshared- and distributed-memory computers

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Preconditioned iterative methods for elliptic problems on decomposed domains, Error analysis on bi-parameter finite elements, Convergence rate estimate for a domain decomposition method

Uses Software

• CGS