Greedy Coarsening Strategies for Nonsymmetric Problems
From MaRDI portal
Publication:3525958
DOI10.1137/060660928zbMATH Open1149.65022OpenAlexW1995192069MaRDI QIDQ3525958FDOQ3525958
Authors: Scott P. MacLachlan, Y. Saad 
Publication date: 23 September 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060660928
Recommendations
- A Greedy Strategy for Coarse-Grid Selection
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- scientific article; zbMATH DE number 991436
- Multilevel algorithm for graph partitioning
- Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
Cited In (8)
- Greedy algorithms for high-dimensional non-symmetric linear problems
- A Greedy Strategy for Coarse-Grid Selection
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Graph coarsening: from scientific computing to machine learning
- AIR multigrid with GMRES polynomials (AIRG) and additive preconditioners for Boltzmann transport
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- Preconditioning Helmholtz linear systems
- Coarse-grid selection using simulated annealing
Uses Software
This page was built for publication: Greedy Coarsening Strategies for Nonsymmetric Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525958)
