Algebraic multigrid methods for Laplacians of graphs
From MaRDI portal
Publication:2431144
numerical resultsconvergence analysisgraph partitioningsingular systemsMoore-Penrose inversecoarse grid correctionalgebraic multigridLaplacians of graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Algebraic Theory of Two-Grid Methods
- A note on algebraic multigrid methods for the discrete weighted Laplacian
- An algebraic multigrid method with guaranteed convergence rate
- Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations
- Algebraic two-level convergence theory for singular systems
- Convergence of algebraic multigrid methods for symmetric and positive definite matrices with weak diagonal dominance
- Convergence analysis of algebraic multi-lattice procedures for M-matrices.
- Spectral AMGe ($\rho$AMGe)
- A Multigrid Method Based on Incomplete Gaussian Elimination
- An algebraic multigrid method for elasticity based on an auxiliary topology with edge matrices
Cites work
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- An Algebraic Multigrid Preconditioner for a Class of Singular M-Matrices
- Convergence of Stationary Iterative Methods for Hermitian Semidefinite Linear Systems and Applications to Schwarz Methods
- Multigrid Methods for Variational Problems
- On algebraic multi-level methods for non-symmetric systems --- comparison results
- On algebraic multilevel methods for non-symmetric systems - convergence results
- On the Convergence of General Stationary Linear Iterative Methods for Singular Linear Systems
- On the Convergence of Iterative Methods for Semidefinite Linear Systems
- On the convergence of splittings for semidefinite linear systems
Cited in
(15)- Algebraic multigrid for directed graph Laplacian linear systems (NS-LAMG).
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- An Algebraic Multigrid Preconditioner for a Class of Singular M-Matrices
- Algebraic two-level convergence theory for singular systems
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- A note on algebraic multigrid methods for the discrete weighted Laplacian
- An adaptive multigrid method based on path cover
- Finite element algorithms for nonlocal minimal graphs
- Algebraic multigrid for k‐form Laplacians
- Geometric multigrid for the tight-binding Hamiltonian of graphene
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Accelerated multigrid for graph Laplacian operators
- Large-Scale Scientific Computing
- A posteriori error estimates for multilevel methods for graph Laplacians
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
This page was built for publication: Algebraic multigrid methods for Laplacians of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431144)
