Greedy Coarsening Strategies for Nonsymmetric Problems

DOI10.1137/060660928MaRDI QIDQ3525958zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

preconditioningalgebraic multigridmatrix partitioningnonsymmetric matricesmultilevel ILU

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

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)

• Coarse-grid selection using simulated annealing
• 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

Describes a project that uses

Uses Software

• ILUT
• ILUM
• BILUTM
• SparseMatrix
• BILUM
• ARMS

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)