Adaptive AMG with coarsening based on compatible weighted matching
From MaRDI portal
Publication:1684418
DOI10.1007/s00791-014-0224-9zbMath1376.65038OpenAlexW2025501795MaRDI QIDQ1684418
Panayot S. Vassilevski, Pasqua D'Ambra
Publication date: 8 December 2017
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc837148/
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10)
Related Items
Adaptive aggregation on graphs ⋮ Algebraic multigrid methods ⋮ Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations ⋮ Extending bootstrap AMG for clustering of attributed graphs ⋮ Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation ⋮ A Root-Node--Based Algebraic Multigrid Method ⋮ Parallel Aggregation Based on Compatible Weighted Matching for AMG ⋮ AMG Preconditioners for Linear Solvers towards Extreme Scale ⋮ A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians ⋮ Numerical results for adaptive (negative norm) constrained first order system least squares formulations ⋮ Reducing complexity of algebraic multigrid by aggregation ⋮ Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm ⋮ An Adaptive Multigrid Method Based on Path Cover
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An aggregation-based algebraic multigrid method
- General highly accurate algebraic coarsening
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- A new pivoting strategy for Gaussian elimination
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
- An Algebraic Multigrid Method with Guaranteed Convergence Rate
- A linear-time approximation algorithm for weighted matchings in graphs
- Bootstrap AMG
- Multigrid Smoothers for Ultraparallel Computing
- Compatible Relaxation and Coarsening in Algebraic Multigrid
- The Use of Linear Graphs in Gauss Elimination
- Coarsening by compatible relaxation
- Multilevel Block Factorization Preconditioners
- Parallel Auxiliary Space AMG for H(Curl) Problems
- On some versions of the element agglomeration AMGe method
- On Generalizing the Algebraic Multigrid Framework
- Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid
- Adaptive Algebraic Multigrid
