Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs

DOI10.1137/120876083zbMath1281.65152arXiv1204.4072OpenAlexW2000073302MaRDI QIDQ2845613

Ludmil T. Zikatanov, Yao Chen, James Brannick, Johannes Kraus

Publication date: 2 September 2013

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4072

zbMATH Keywords

aggregationconvergencefinite elementfinite differencenumerical testgraph Laplacianmultilevel preconditioningmatching in graphs

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06) Graph algorithms (graph-theoretic aspects) (05C85) Preconditioners for iterative methods (65F08)

Related Items

Adaptive AMG with coarsening based on compatible weighted matching, Iterative solution of spatial network models by subspace decomposition, Coarse-grid selection using simulated annealing, Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation, 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, Multigrid methods for convection-diffusion problems discretized by a monotone scheme, An Adaptive Multigrid Method Based on Path Cover, Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks, Theoretical bounds for algebraic multigrid performance: review and analysis, Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning