Imagen de Portada
Código QR

A Fast Solver for a Class of Linear Systems.

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...

Descripción completa

Publicado en:Communications of the ACM Vol. 55; no. 10; pp. 99 - 108
Autores principales: Koutis, Ioannis, Miller, Gary L., Peng, Richard
Formato: Artículo
Publicado: Association for Computing Machinery Oct2012
Materias:
Linear systems
Systems theory
Algorithms
Applied mathematics
Graph theory
Charts, diagrams, etc.
Acceso en línea:Ver este registro en EBSCOhost
Sumario: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.