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

DOI10.1137/0913008MaRDI QIDQ3990908zbMATH OpenOpenAlexFDO

Authors William Gropp, D. E. Keyes

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

boundary layerscomputational complexityconjugate gradient squaredconvection-diffusion problemsconvergence ratedomain decompositiongeneralized minimal residualiterative methodslocal mesh refinementnumerical experimentsparallel computingshared- and distributed-memory computers

Mathematics Subject Classification ID

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

Cited in

(3)

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

Describes a project that uses

Uses Software

• CGS

This page was built for publication: Parallel Performance of Domain-Decomposed Preconditioned Krylov Methods for PDE<scp>s</scp>with Locally Uniform Refinement

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