A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians
From MaRDI portal
Publication:5161767
DOI10.1137/20M1349618zbMath1481.65257arXiv2007.00189OpenAlexW3196406539MaRDI QIDQ5161767
Xiaozhe Hu, Ludmil T. Zikatanov, Kaiyi Wu
Publication date: 1 November 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.00189
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical optimization and variational techniques (65K10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)
Related Items (2)
Iterative solution of spatial network models by subspace decomposition ⋮ Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- An aggregation-based algebraic multigrid method
- An efficient multigrid method for graph Laplacian systems
- Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems
- Laplacian matrices of graphs: A survey
- A posteriori error estimation in finite element analysis
- Adaptive aggregation on graphs
- Adaptive AMG with coarsening based on compatible weighted matching
- Algebraic multigrid methods for Laplacians of graphs
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
- Algebraic multilevel iteration method for lowest order Raviart-Thomas space and applications
- An Algebraic Multigrid Method with Guaranteed Convergence Rate
- Primer of Adaptive Finite Element Methods
- The university of Florida sparse matrix collection
- Guaranteed and robust error bounds for nonconforming approximations of elliptic problems
- Towards Adaptive Smoothed Aggregation ($\alpha$SA) for Nonsymmetric Problems
- Bootstrap AMG
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
- A posteriori error analysis and adaptive processes in the finite element method: Part I—error analysis
- Bootstrap Algebraic Multigrid: Status Report, Open Problems, and Outlook
- Iterative Methods by Space Decomposition and Subspace Correction
- Algorithmic Aspects of Vertex Elimination on Graphs
- A‐posteriori error estimates for the finite element method
- Explicit error bounds in a conforming finite element method
- A Posteriori Error Estimates for Nonlinear Problems. Finite Element Discretizations of Elliptic Equations
- A Multigrid Tutorial, Second Edition
- Algebraic multigrid methods
- Adaptive Smoothed Aggregation ($\alpha$SA)
- Computing the diffusion state distance on graphs via algebraic multigrid and random projections
- Robust and adaptive multigrid methods: comparing structured and algebraic approaches
- Convergence analysis of the Fast Subspace Descent method for convex optimization problems
- Efficient preconditioning of laplacian matrices for computer graphics
- An Adaptive Multigrid Method Based on Path Cover
- Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid
- A multigrid method based on graph matching for convection–diffusion equations
- Adaptive Hypergraph Learning and its Application in Image Classification
- Multimodal Graph-Based Reranking for Web Image Search
- Adaptive Algebraic Multigrid
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- Commuting projections on graphs
- Approximations in elasticity based on the concept of function space
This page was built for publication: A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians
