Improving the arithmetic intensity of multigrid with the help of polynomial smoothers

DOI10.1002/nla.1808zbMath1274.65317OpenAlexW1825532946MaRDI QIDQ4921808

Przemyslaw Klosiewicz, Pieter Ghysels, Wim Vanroose

Publication date: 13 May 2013

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1808

zbMATH Keywords

algorithmconvergencemultigridChebyshev iterationV-cyclearithmetic intensitybound by memory bandwidth

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Related Items (3)

Multigrid methods for convection-diffusion problems discretized by a monotone scheme ⋮ Porting an aggregation-based algebraic multigrid method to GPUs ⋮ Modeling the Performance of Geometric Multigrid Stencils on Multicore Computer Architectures

Uses Software

• ATLAS
• OSKI
• CHEBYCODE

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• The cache complexity of multithreaded cache oblivious algorithms
• s-step iterative methods for symmetric linear systems
• The Tchebychev iteration for nonsymmetric linear systems
• Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
• 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
• A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
• CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS

This page was built for publication: Improving the arithmetic intensity of multigrid with the help of polynomial smoothers