CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS

DOI10.1080/10637199608915575zbMATH Open1049.68886OpenAlexW2088949989MaRDI QIDQ4820177FDOQ4820177

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

• Title not available (Why is that?)
• Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
• A Unified Convergence Theory for Abstract Multigrid or Multilevel Algorithms, Serial and Parallel
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• Estimates for multigrid methods based on red-black Gauss-Seidel smoothings

Cited In (8)

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

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)