DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Algebraic multigrid for directed graph Laplacian linear systems (NS‐LAMG)

Journal Article · · Numerical Linear Algebra with Applications
DOI: https://doi.org/10.1002/nla.2152 · OSTI ID:1418882
ORCiD logo [1];  [2]
  1. Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 USA
  2. Department of Applied Mathematics University of Colorado Boulder Boulder CO 80303 USA

Summary We propose nonsymmetric lean algebraic multigrid (NS‐LAMG), a new algebraic multigrid algorithm for directed graph Laplacian systems that combines ideas from undirected graph Laplacian multigrid solvers and multigrid algorithms for Markov chain stationary distribution systems. Low‐degree elimination, proposed in LAMG for undirected graphs, is generalized to directed graphs and is a key component of NS‐LAMG. In the setup phase, we propose a simple stationary‐aggregation multigrid algorithms for Markov chain stationary distribution systems solver enhanced by low‐degree elimination to find the right null‐space vector that is used for the intergrid transfer operators. Numerical results show that low‐degree elimination improves performance and that NS‐LAMG outperforms generalized minimal residual method with restart and stable bi‐conjugate gradient method for real‐world, directed graph Laplacian linear systems.

Sponsoring Organization:
USDOE
Grant/Contract Number:
AC52-07NA27344
OSTI ID:
1418882
Journal Information:
Numerical Linear Algebra with Applications, Journal Name: Numerical Linear Algebra with Applications Journal Issue: 3 Vol. 25; ISSN 1070-5325
Publisher:
Wiley Blackwell (John Wiley & Sons)Copyright Statement
Country of Publication:
United Kingdom
Language:
English

References (30)

A robust algebraic multilevel preconditioner for non-symmetricM-matrices journal January 2000
Recursive Krylov-based multigrid cycles journal January 2008
Square and stretch multigrid for stochastic matrix eigenproblems: SQUARE AND STRETCH MULTIGRID journal February 2010
Fast multilevel methods for Markov chains: FAST MULTILEVEL METHODS FOR MARKOV CHAINS journal October 2011
Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains journal June 2010
On a two-level multigrid solution method for finite Markov chains journal July 1995
Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing journal December 2011
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications journal January 2005
The Computer Realization of the QR Decomposition on Matrices with Full Column Rank conference December 2009
Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid journal January 2005
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking journal January 2008
Smoothed Aggregation Multigrid for Markov Chains journal January 2010
Towards Adaptive Smoothed Aggregation ($\alpha$SA) for Nonsymmetric Problems journal January 2010
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems journal July 1986
Algebraic Multigrid for Markov Chains journal January 2010
Recursively Accelerated Multilevel Aggregation for Markov Chains journal January 2010
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems journal January 2014
Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems journal March 1992
A Spectral Clustering Approach To Finding Communities in Graphs conference January 2014
A Bootstrap Algebraic Multilevel Method for Markov Chains journal January 2011
On-the-Fly Adaptive Smoothed Aggregation Multigrid for Markov Chains journal January 2011
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver journal January 2012
Approaching Optimality for Solving SDD Linear Systems journal January 2014
Julia: A Fresh Approach to Numerical Computing journal January 2017
Center-piece subgraphs: problem definition and fast solutions conference January 2006
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs conference January 2011
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time conference January 2013
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
  • Cohen, Michael B.; Kelner, Jonathan; Peebles, John
  • STOC '17: Symposium on Theory of Computing, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing https://doi.org/10.1145/3055399.3055463
conference June 2017
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares journal March 1982
Algebraic connectivity of graphs [Algebraic connectivity of graphs] journal January 1973