CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS

DOI10.1080/10637199608915575MaRDI QIDQ4820177zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 4078694 (Why is no real title available?)
• A Unified Convergence Theory for Abstract Multigrid or Multilevel Algorithms, Serial and Parallel
• 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

Cited in

(8)

• Parallel adaptive subspace correction schemes with applications to elasticity
• A cache‐oblivious self‐adaptive full multigrid method
• 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 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
• Patch-adaptive multilevel iteration

Describes a project that uses

Uses Software

• NAS Parallel Benchmarks

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

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