NEW HIGHLY PARALLEL SPARSE MATRIX SOLVER.

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

1 Scopus citations

Abstract

A new method requiring O(log N) operations for the factorization of a symmetric tridiagonal Toeplitz matrix is presented. The method is shown to require O(N) operations in O(log N) steps using N processors for forward and backward substitution, and to exhibit a high degree of parallelism. The algorithm is derived using a generalized form of Gauss elimination which is applicable, with other operation-count bounds, to the general sparse matrix problem.

Original languageEnglish (US)
Title of host publicationConference Proceedings - Annual Phoenix Conference
PublisherIEEE
Pages82-86
Number of pages5
ISBN (Print)0818606916
StatePublished - Dec 1 1986

Publication series

NameConference Proceedings - Annual Phoenix Conference

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tylavsky, D. (1986). NEW HIGHLY PARALLEL SPARSE MATRIX SOLVER. In Conference Proceedings - Annual Phoenix Conference (pp. 82-86). (Conference Proceedings - Annual Phoenix Conference). IEEE.