A low‐communication, parallel algorithm for solving PDEs based on range decomposition
DOI10.1002/NLA.2041zbMATH Open1424.65264OpenAlexW2328493000MaRDI QIDQ5355089FDOQ5355089
Authors: David J. Appelhans, Thomas A. Manteuffel, S. F. McCormick, John Ruge 
Publication date: 6 September 2017
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.2041
Recommendations
- The efficient parallel solution of PDEs
- Domain decomposition methods for the solution of partial differential equations. A parallel approach
- scientific article; zbMATH DE number 1867482
- scientific article; zbMATH DE number 1156752
- Solving PDEs on loosely-coupled parallel processors
- scientific article; zbMATH DE number 4111948
- scientific article; zbMATH DE number 4009715
- Part IV Parallel algorithms for partial differential equations
- Parallel algorithms for a singularly perturbed parabolic problem
- Domain decomposition methods for solving parabolic PDEs on multiprocessors
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cited In (4)
- Expandable parallel finite element methods for linear elliptic problems
- The swept rule for breaking the latency barrier in time advancing PDEs
- Preparing sparse solvers for exascale computing
- Advances in implementation, theoretical motivation, and numerical results for the nested iteration with range decomposition algorithm.
This page was built for publication: A low‐communication, parallel algorithm for solving PDEs based on range decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355089)
