Modeling the Performance of Geometric Multigrid Stencils on Multicore Computer Architectures
From MaRDI portal
Publication:5254467
DOI10.1137/130935781zbMath1320.65152OpenAlexW2008436719MaRDI QIDQ5254467
Publication date: 9 June 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10067/1244840151162165141
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cache optimization for structured and unstructured grid multigrid
- Cache-aware multigrid methods for solving Poisson's equation in two dimensions
- Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors
- A Multigrid Tutorial, Second Edition
- CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS
- Improving the arithmetic intensity of multigrid with the help of polynomial smoothers
This page was built for publication: Modeling the Performance of Geometric Multigrid Stencils on Multicore Computer Architectures