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 language||English (US)|
|Number of pages||9|
|Journal||Communications of the ACM|
|State||Published - Oct 2012|
All Science Journal Classification (ASJC) codes
- Computer Science(all)