Title :
On computational algorithm for inners
Author_Institution :
University of California Berkeley, Berkeley, CA, USA
fDate :
4/1/1974 12:00:00 AM
Abstract :
A modification is suggested to the computational algorithm for inners in [1], [2] in order to lessen the roundoff errors arising in computer calculations taking into consideration fixed structure of sparseness of left triangle of zeros without destroying the inners of original matrix.
Keywords :
Determinants; Finite-wordlength effects; Matrices; Sparse-matrix methods; Clustering algorithms; Frequency response; Polynomials; Sparse matrices;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1974.1100509
