An Adaptive Multigrid Method Based on Path Cover
From MaRDI portal
Publication:5241251
DOI10.1137/18M1194493zbMath1428.65106arXiv1806.07028OpenAlexW2982631818WikidataQ126856487 ScholiaQ126856487MaRDI QIDQ5241251
Junyuan Lin, Xiaozhe Hu, Ludmil T. Zikatanov
Publication date: 30 October 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07028
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (5)
Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations ⋮ A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians ⋮ Contractive local adaptive smoothing based on Dörfler's marking in a-posteriori-steered \(p\)-robust multigrid solvers ⋮ Preconditioning Parametrized Linear Systems ⋮ Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An aggregation-based algebraic multigrid method
- Statistical ranking and combinatorial Hodge theory
- Arc coverings of graphs
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- A multilevel method with overcorrection by aggregation for solving discrete elliptic problems
- Adaptive aggregation on graphs
- Adaptive AMG with coarsening based on compatible weighted matching
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Tensor factorization using auxiliary information
- Comparative Convergence Analysis of Nonlinear AMLI-Cycle Multigrid
- Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
- The university of Florida sparse matrix collection
- Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
- Operator-based interpolation for bootstrap algebraic multigrid
- Bootstrap AMG
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
- Adaptive reduction-based AMG
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Algebraic multigrid methods
- Computing the diffusion state distance on graphs via algebraic multigrid and random projections
- The Steerable Graph Laplacian and its Application to Filtering Image Datasets
- Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid
- A multigrid method based on graph matching for convection–diffusion equations
- Collective dynamics of ‘small-world’ networks
- Adaptive Algebraic Multigrid
- Convergence of algebraic multigrid based on smoothed aggregation
This page was built for publication: An Adaptive Multigrid Method Based on Path Cover
