A fast solver for a class of linear systems

Ioannis Koutis, Gary L. Miller, Richard Peng

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


The solution of linear systems is a problem of fundamental theoretical importance but also one with a myriad of applications in numerical mathematics, engineering, and science. Linear systems that are generated by real-world applications frequently fall into special classes. Recent research led to a fast algorithm for solving symmetric diagonally dominant (SDD) linear systems. We give an overview of this solver and survey the underlying notions and tools from algebra, probability, and graph algorithms. We also discuss some of the many and diverse applications of SDD solvers.

Original languageEnglish (US)
Pages (from-to)99-107
Number of pages9
JournalCommunications of the ACM
Issue number10
StatePublished - Oct 2012
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'A fast solver for a class of linear systems'. Together they form a unique fingerprint.

Cite this