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

Detalles Bibliográficos
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:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=82153093&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 82153093
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Oct2012
      vid: 55
      iid: 10
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        82153093
        10.1145/2347736.2347759
      ppf: 99
      ppct: 9
      formats:
      tig:
        atl: A Fast Solver for a Class of Linear Systems.
      aug:
        au:
          Koutis, Ioannis
          Miller, Gary L.
          Peng, Richard
        affil:
          Computer Science Department, University of Puerto Rico-Rio Piedras
          Computer Science Department, Carnegie Mellon University.
          Computer Science Department, Carnegie Mellon University
      su:
        Linear systems
        Systems theory
        Algorithms
        Applied mathematics
        Graph theory
        Charts, diagrams, etc.
      sug:
        subj:
          Linear systems
          Systems theory
          Algorithms
          Applied mathematics
          Graph theory
          Charts, diagrams, etc.
      ab: 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.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2012
    holdings:
      @attributes:
        islocal: N