A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix

Samuel I. Daitch, Daniel A. Spielman. A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix. In Uwe Naumann, Olaf Schenk, Horst D. Simon, Sivan Toledo, editors, Combinatorial Scientific Computing, 01.02. - 06.02.2009. Volume 09061 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. [doi]

@inproceedings{DaitchS09,
  title = {A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix},
  author = {Samuel I. Daitch and Daniel A. Spielman},
  year = {2009},
  url = {http://drops.dagstuhl.de/opus/volltexte/2009/2080/},
  researchr = {https://researchr.org/publication/DaitchS09},
  cites = {0},
  citedby = {0},
  booktitle = {Combinatorial Scientific Computing, 01.02. - 06.02.2009},
  editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  volume = {09061},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany},
}