Preconditioning algorithm for symmetric diagonally dominant linear systems

MaRDI QIDQ2993590zbMATH OpenFDO

Authors Huirong Zhang, Jian-Wen Cao

Publication date 10 August 2016

zbMATH Keywords

Laplacian matrixtree-decompositionincomplete LU factorizationcombinatorial preconditioninglow-stretch spanning treesymmetric diagonally dominant matrixtree-decomposition algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Trees (05C05) Preconditioners for iterative methods (65F08)

Recommendations

• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• Efficient approximate solution of sparse linear systems
• A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
• Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
• Engineering a combinatorial Laplacian solver: lessons learned

Cited in

(6)

• Combinatorial preconditioners for scalar elliptic finite-element problems
• Stochastic Preconditioning for Diagonally Dominant Matrices
• Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• Maximum‐weight‐basis preconditioners
• Preconditioners based on strong subgraphs

This page was built for publication: Preconditioning algorithm for symmetric diagonally dominant linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993590)