Preconditioning algorithm for symmetric diagonally dominant linear systems
From MaRDI portal
Publication:2993590
zbMATH Open1349.65113MaRDI QIDQ2993590FDOQ2993590
Authors: Huirong Zhang, Jian-Wen Cao 
Publication date: 10 August 2016
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
Laplacian matrixtree-decompositionincomplete LU factorizationcombinatorial preconditioninglow-stretch spanning treesymmetric diagonally dominant matrixtree-decomposition algorithm
Computational methods for sparse matrices (65F50) Trees (05C05) Preconditioners for iterative methods (65F08)
Cited In (6)
- Stochastic Preconditioning for Diagonally Dominant Matrices
- Sparse inverse incidence matrices for Schilders' factorization applied to resistor network modeling
- Maximum‐weight‐basis preconditioners
- Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
- Preconditioners based on strong subgraphs
- Combinatorial preconditioners for scalar elliptic finite-element problems
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)
