An efficient multigrid method for graph Laplacian systems
zbMATH Open1347.65059MaRDI QIDQ739919FDOQ739919
Authors: Artem Napov, Yvan Notay 
Publication date: 11 August 2016
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol45/abstract_vol45_pp201-218.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Algebraic multigrid for directed graph Laplacian linear systems (NS-LAMG).
- Accelerated multigrid for graph Laplacian operators
- Aggregation-Based Aggressive Coarsening with Polynomial Smoothing
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cited In (19)
- Least Angle Regression Coarsening in Bootstrap Algebraic Multigrid
- AI‐enhanced iterative solvers for accelerating the solution of large‐scale parametrized systems
- Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- Multilevel spectral coarsening for graph Laplacian problems with application to reservoir simulation
- Algebraic multigrid for directed graph Laplacian linear systems (NS-LAMG).
- Numerical methods for Gremban's expansion of signed graphs
- Spectral upscaling for graph Laplacian problems with application to reservoir simulation
- Coarsening in algebraic multigrid using Gaussian processes
- A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
- Iterative solution of spatial network models by subspace decomposition
- An adaptive multigrid method based on path cover
- Multilevel Splitting of Weighted Graph-Laplacian Arising in Non-conforming Mixed FEM Elliptic Problems
- Solving cheap graph problems on Meshes
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Accelerated multigrid for graph Laplacian operators
- Improving the communication pattern in matrix-vector operations for large scale-free graphs by disaggregation
- A posteriori error estimates for multilevel methods for graph Laplacians
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
Uses Software
This page was built for publication: An efficient multigrid method for graph Laplacian systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739919)
