An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation

DOI10.1137/16M1071420zbMath1392.65037MaRDI QIDQ5372634

Artem Napov, Yvan Notay

Publication date: 27 October 2017

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

zbMATH Keywords

aggregationconvergence analysispreconditioningmultigridalgebraic multigridgraph Laplacian

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (8)

MGIC: Multigrid-in-Channels Neural Network Architectures ⋮ Multigrid incomplete factorization methods in Krylov subspaces ⋮ On multigrid methods for solving two-dimensional boundary-value problems ⋮ Numerical Methods for Gremban's Expansion of Signed Graphs ⋮ A queueing network-based distributed Laplacian solver ⋮ A divide-and-conquer bound for aggregate's quality and algebraic connectivity ⋮ Iterative preconditioned methods in Krylov spaces: trends of the 21st century ⋮ Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

Uses Software

• SparseMatrix
• LAMG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An aggregation-based algebraic multigrid method
• An efficient multigrid method for graph Laplacian systems
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• Algebraic multigrid methods for Laplacians of graphs
• Flexible Conjugate Gradients
• Algebraic Two-Level Convergence Theory for Singular Systems
• Algebraic analysis of aggregation-based multigrid
• An Algebraic Multigrid Method with Guaranteed Convergence Rate
• The university of Florida sparse matrix collection
• Emergence of Scaling in Random Networks
• Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
• Multilevel Block Factorization Preconditioners
• Recursive Krylov‐based multigrid cycles
• Support Theory for Preconditioning
• On Generalizing the Algebraic Multigrid Framework

This page was built for publication: An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation