Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning

DOI10.1137/15M1050872zbMath1371.65030OpenAlexW2393680604MaRDI QIDQ5348222

Panayot S. Vassilevski, Colin Ponce

Publication date: 14 August 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

condition numberdirect methodnumerical experimentgraph Laplaciantwo-grid methodsrecursive bisectionsupport graph preconditioners

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)

Related Items (2)

A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations ⋮ Iterative preconditioned methods in Krylov spaces: trends of the 21st century

Uses Software

• SNAP
• PT-Scotch

Cites Work

• Unnamed Item
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• Emergence of Scaling in Random Networks
• Multilevel Block Factorization Preconditioners
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• On two‐grid convergence estimates
• Generalized Nested Dissection
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Collective dynamics of ‘small-world’ networks
• A Nearly-m log n Time Solver for SDD Linear Systems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning