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

DOI10.1002/NLA.1808MaRDI QIDQ4921808zbMATH OpenOpenAlexFDO

Authors Pieter Ghysels, Przemyslaw Klosiewicz, 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

algorithmarithmetic intensitybound by memory bandwidthChebyshev iterationconvergencemultigridV-cycle

Mathematics Subject Classification ID

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

Recommendations

• Modeling the performance of geometric multigrid stencils on multicore computer architectures
• scientific article; zbMATH DE number 1728267
• Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
• scientific article; zbMATH DE number 1894260
• Multigrid smoothers for ultraparallel computing

Cites work

• A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
• A Multigrid Tutorial, Second Edition
• Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
• Cache optimization for structured and unstructured grid multigrid
• Cache-aware multigrid methods for solving Poisson's equation in two dimensions
• CACHING IN WITH MULTIGRID ALGORITHMS: PROBLEMS IN TWO DIMENSIONS
• scientific article; zbMATH DE number 1729264 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• Optimization and Performance Modeling of Stencil Computations on Modern Microprocessors
• Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
• s-step iterative methods for symmetric linear systems
• The cache complexity of multithreaded cache oblivious algorithms
• The Tchebychev iteration for nonsymmetric linear systems

Cited in

(6)

• Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
• Porting an aggregation-based algebraic multigrid method to GPUs
• Multigrid methods for convection-diffusion problems discretized by a monotone scheme
• Impact of mixed precision and storage layout on additive Schwarz smoothers
• Modeling the performance of geometric multigrid stencils on multicore computer architectures
• Optimal polynomial smoothers for parallel AMG

Describes a project that uses

Uses Software

• ATLAS
• OSKI
• CHEBYCODE

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

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