CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS

DOI10.1080/10637199608915575zbMath1049.68886OpenAlexW2088949989MaRDI QIDQ4820177

Craig C. Douglas

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199608915575

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (8)

Patch-adaptive multilevel iteration ⋮ Improving the arithmetic intensity of multigrid with the help of polynomial smoothers ⋮ Multigrid method and fourth-order compact scheme for 2D Poisson equation with unequal mesh-size discretization ⋮ A cache‐oblivious self‐adaptive full multigrid method ⋮ Parallel adaptive subspace correction schemes with applications to elasticity ⋮ A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM ⋮ Modeling the Performance of Geometric Multigrid Stencils on Multicore Computer Architectures ⋮ Robust multigrid methods for nonsmooth coefficient elliptic linear systems

Uses Software

• NAS Parallel Benchmarks

Cites Work

• Estimates for multigrid methods based on red-black Gauss-Seidel smoothings
• Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• A Unified Convergence Theory for Abstract Multigrid or Multilevel Algorithms, Serial and Parallel
• Unnamed Item

This page was built for publication: CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS