Multisplitting methods: Optimal schemes for the unknowns in a given overlap

DOI10.1137/S0895479898334678zbMATH Open0973.65023OpenAlexW2020478979MaRDI QIDQ2706274

R. E. White

Publication date: 19 March 2001

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

overlappingconvergencenumerical resultsdomain decompositioniterative methodsparallel computingpreconditionermultisplitting methodrestarted GMRES algorithm

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)

Related Items (1)

Domain decomposition splittings

Recommendations

• Nonstationary two-stage multisplitting methods with overlapping blocks 👍 👎
• Iterative methods for multicomponent splitting 👍 👎
• Multisplittings and parallel iterative methods 👍 👎
• Two-stage Multisplitting Methods with Overlapping Blocks 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Multisplitting methods: Optimal schemes for the unknowns in a given overlap

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