Support-Graph Preconditioners
From MaRDI portal
combinatorial preconditionersincomplete Cholesky preconditionermodified incomplete factorizationspreconditioningsupport preconditionerssupport theorysupport-tree preconditioners
Graph algorithms (graph-theoretic aspects) (05C85) Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)
Recommendations
- Extensions of Certain Graph-based Algorithms for Preconditioning
- Preconditioners based on strong subgraphs
- Prim-based support-graph preconditioners for min-cost flow problems
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
- Support Theory for Preconditioning
- Parameter selection and preconditioning for a graph form solver
- Solving graph Laplacian systems through recursive partitioning and two-grid preconditioning
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
Cited in
(13)- Vaidya's preconditioners: Implementation and experimental study
- Iterative solution methods
- Iterative preconditioned methods in Krylov spaces: trends of the 21st century
- Support measures for graph data
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- Maximum‐weight‐basis preconditioners
- Support Theory for Preconditioning
- Iterative ILU preconditioners for linear systems and eigenproblems
- Lower bounds to the spectral gap of Davies generators
- Hybrid Sparse Linear Solutions with Substituted Factorization
- Accelerated multigrid for graph Laplacian operators
- Support graph preconditioners for off-lattice cell-based models
- AC(k): robust solution of Laplacian equations by randomized approximate Cholesky factorization
This page was built for publication: Support-Graph Preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470502)
