Generalized scans and tri-diagonal systems

Paul F. Fischer, Franco P. Preparata, John E. Savage

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The classical problem of solving tridiagonal linear systems of equations is reconsidered. An extremely simple factorization of the system's matrix - implied by but not explicit in the known techniques - is identified and shown to belong to a class of transformations termed generalized scans. This class has an associative property which is the key to the complete parallelization of the technique. Due to the very weak constraints upon which it is based, the method extends naturally to arbitrary banded systems.

Original languageEnglish (US)
Title of host publicationSTACS 1995 - 12th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsErnst W. Mayr, Claude Puech
PublisherSpringer
Pages168-180
Number of pages13
ISBN (Print)3540590420, 9783540590422
DOIs
StatePublished - 1995
Externally publishedYes
Event12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 - Munich, Germany
Duration: Mar 2 1995Mar 4 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume900
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995
Country/TerritoryGermany
CityMunich
Period3/2/953/4/95

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Generalized scans and tri-diagonal systems'. Together they form a unique fingerprint.

Cite this