On computational algorithm for inners

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.

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1974-04, Vol.19 (2), p.154-155
Main Author: Kamat, P.
Format: Article
Language:English
Subjects:
Clustering algorithms
Frequency response
Polynomials
Sparse matrices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.1974.1100509