Advertisement

A VLSI array for stable matrix inversion using gauss-jordan diagonalization

  • A. El-Amawy
  • K. R. Dharmarajan
Conference paper
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 130)

Abstract

A purely systolic architecture for computing the inverse of a matrix has been presented. The architecture implements an inversion algorithm based on the Gauss-Jordan diagonalization method with partial pivoting. The architecture employs 4n+1 PEs and has a time complexity of O(n2). Thus the area-time complexity is O(n3), which matches the performance of the fastest systolic implementation of matrix inversion (numerically unstable in most cases), reported to date.

A regular and continuous data flow is maintained within the array. The bilinear array has been supplemented with a buffer array to eliminate the need for costly inter-iteration I/O. Thus, the total number of I/O operations has been minimized and I/O operations are needed only to input the matrix to be inverted and to retrieve its inverse.

Keywords

Matrix Inversion Systolic Array Input Element VLSI Architecture Pivot Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    El-Amawy A., "High speed inversion of dense matrices on an optimal systolic array", CompEuro Conf. Proc., Hamburg, W. Germany, pp. 707–711, May 1987.Google Scholar
  2. 2.
    Chern M. and Murata, T., "A fast algorithm for LU decomposition and matrix inversion", Proc. Int'l. Conf. on Parallel Processing, Columbus, OH, pp. 79–86, Aug. 1983.Google Scholar
  3. 3.
    Comon P. and Robert Y., "A Systolic array for computing BA−1", IEEE Trans. on Accoustics, Speech and Signal Processing, Vol. ASSP-35, No. 6, June 1987.Google Scholar
  4. 4.
    El-Amawy, A. and Barada, H., "Efficient Linear and Bilinear Arays for Matrix Triangularization with Partial Pivoting", 21st Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, pp. 757–761.Google Scholar
  5. 5.
    Wilkinson, J.H., "The Algebraic Eigenvalue Problem", Oxford University Press, 1965.Google Scholar
  6. 6.
    Stewart, G.W., "Introduction to Matrix Computations", Academic Press, 1973.Google Scholar
  7. 7.
    Rau, N., "Matrices and Mathematical Programming", St. Martin's Press, New York, 1981.Google Scholar
  8. 8.
    Peters, G. and Wilkinson, J.H., "On the stability of Gauss-Jordan elimination with pivoting", Communications of the ACM, Vol. 18, pp. 20–24, Jan. 1975.Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • A. El-Amawy
    • 1
  • K. R. Dharmarajan
    • 1
  1. 1.Louisiana State UniversityUSA

Personalised recommendations