ON THE SOLUTION OF LINEAR ALGEBRAIC SYSTEMS BY MATRIX DECOMPOSITION.

Abstract

A theorem is proved which states that the inverse matrix A sup(-1)sub n of any nonsingular matrix A sub n could be expressed as a unique sequence of U sup(i)sub n D sup(i)sub n L sup(i)sub n products where D sup(i)sub n is an n-th order diagonal matrix, U sup(i)sub n is a special n-th order upper triangular matrix, L sup(i)sub n is a special n-th order lower triangular matrix and i runs from 1 up to n. It is also shown that the inverse of each principal minor matrix A sub k with det(A sub k) not = o is also generated in product form. Furthermore the non-zero column above the diagonal of each U sup(i)sub n is the solution of the system A sub(i-1)Xsub(i-1)+Csubi=0 where C sub i = (a sub K,i), 1 < or = k < or = (i-1). The associated algorithm is described together with considerations on storage arrangement, pivoting and operational counts. Finally an example is given in the Appendix. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1970
Accession Number
AD0712680

Entities

People

  • Franklin F. Kuo
  • Nai-kuan Tsao

Organizations

  • University of HawaiĘ»i System

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Decomposition
  • Mathematics
  • Sequences

Readers

  • Linear Algebra