Elsevier

Parallel Computing

Volume 19, Issue 8, August 1993, Pages 925-937
Parallel Computing

Short communication
Algorithms for LU decomposition on a shared memory multiprocessor

https://doi.org/10.1016/0167-8191(93)90075-VGet rights and content

Abstract

In this paper we propose an improved algorithm for the parallel LU decomposition of an (m + 1)-banded upper Hessenberg matrix on a shared memory multi-processor, which requires O(2nm2/p) parallel operations, where n is the dimension of the matrix and p is the number of processors. We show that for the special case of tridiagonal matrices this algorithms has a lower operation count than those in the literature and yields the best existing algorithm for the solution of tridiagonal systems of equations.

References (12)

  • H.A van der Vorst

    Analysis of a parallel solution method for tridiagonal systems

    Parallel Comput.

    (1987)
  • J Buoni et al.

    Parallel LU decomposition of Upper Hessenberg Matrices

  • S.C Chen et al.

    Practical parallel band triangular system solvers

    ACM TOMS

    (1978)
  • D.B Gannon et al.

    On the impact of communication complexity on the design of parallel numerical algorithms

    IEEE Trans. Comput.

    (1984)
  • R.W Hockney et al.

    Parallel Computers 2 - Architecture, Programming and Algorithms

    (1988)
  • S.L Johnsson

    Solving tridiagonal systems on ensemble architectures

    SIAM J. Sci. Stat. Comput.

    (1987)
There are more references available in the full text version of this article.

Cited by (0)

View full text