Cache Issues of Algebraic Multigrid Methods for Linear Systems with Multiple Right-Hand Sides

DOI10.1137/S1064827502405112zbMath1087.65027OpenAlexW1980308665MaRDI QIDQ5693184

Stefan Reitzinger, Gundolf Haase

Publication date: 22 September 2005

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827502405112

zbMATH Keywords

numerical examplespreconditioningparallel computationalgebraic multigrid methodnonuniform memory accesscache algorithmsblock conjugate gradient methods

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (6)

A new family of global methods for linear systems with multiple right-hand sides ⋮ Some high order formulae for approximating Caputo fractional derivatives ⋮ Multiple right-hand side techniques for the numerical simulation of quasistatic electric and magnetic fields ⋮ A Hilbert-order multiplication scheme for unstructured sparse matrices ⋮ Accuracy and run-time comparison for different potential approaches and iterative solvers in finite element method based EEG source analysis ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides

Uses Software

• SuperLU
• PEBBLES

This page was built for publication: Cache Issues of Algebraic Multigrid Methods for Linear Systems with Multiple Right-Hand Sides