An efficient multigrid method for graph Laplacian systems
From MaRDI portal
Publication:739919
zbMath1347.65059MaRDI QIDQ739919
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
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
Least Angle Regression Coarsening in Bootstrap Algebraic Multigrid, Iterative solution of spatial network models by subspace decomposition, AI‐enhanced iterative solvers for accelerating the solution of large‐scale parametrized systems, Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation, An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation, Numerical Methods for Gremban's Expansion of Signed Graphs, A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians, A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations, Coarsening in algebraic multigrid using Gaussian processes, Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation
Uses Software
