Maximum-weight-basis preconditioners

@article{Boman2004MaximumweightbasisP,
  title={Maximum-weight-basis preconditioners},
  author={Erik G. Boman and Doron Chen and Bruce Hendrickson and Sivan Toledo},
  journal={Numerical Lin. Alg. with Applic.},
  year={2004},
  volume={11},
  pages={695-721}
}
SUMMARY This paper analyses a novel method for constructing preconditioners for diagonally dominant symmetric positive-denite matrices. The method discussed here is based on a simple idea: we construct M by simply dropping odiagonal non-zeros from A and modifying the diagonal elements to maintain a certain row-sum property. The preconditioners are extensions of Vaidya's augmented maximum-spanning-tree preconditioners. The preconditioners presented here were also mentioned by Vaidya in an… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS

Support graph preconditioning for elliptic finite element problems

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Performance-Guided Graph Sparsification Approach to Scalable and Robust SPICE-Accurate Integrated Circuit Simulations

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2015
VIEW 2 EXCERPTS
CITES METHODS