Modifying CLJP to select grid hierarchies with lower operator complexities and better performance

DOI10.1002/nla.473zbMath1174.65351OpenAlexW2000038281MaRDI QIDQ3618027

David M. Alber

Publication date: 31 March 2009

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

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

zbMATH Keywords

parallel computingalgebraic multigridlarge sparse linear systemslarge-scale problemscoarse grid selection algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (1)

Algebraic interface‐based coarsening AMG preconditioner for multi‐scale sparse matrices with applications to radiation hydrodynamics computation

Uses Software

• hypre

Cites Work

• A Multigrid Tutorial, Second Edition
• Unnamed Item

This page was built for publication: Modifying CLJP to select grid hierarchies with lower operator complexities and better performance