Share Email Print

Proceedings Paper

Time-varying computational networks: realization, lossless embedding, and structural factorization
Author(s): Alle-Jan van der Veen; Patrick W. Dewilde
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Many computational schemes in linear algebra can be studied from the point of view of (discrete) time-varying linear systems theory. For example, the operation `multiplication of a vector by an upper triangular matrix' can be represented by a computational scheme (or model) that acts on the entries of the vector sequentially. The number of intermediate quantities (`states') that are needed in the computations is a measure of the complexity of the model. If the matrix is large but its complexity is low, then not only multiplication, but also other operations such as inversion and factorization, can be carried out efficiently using the model rather than the original matrix. In the present paper we discuss a number of techniques in time-varying system theory that can be used to capture a given matrix into such a computational network.

Paper Details

Date Published: 30 November 1992
PDF: 14 pages
Proc. SPIE 1770, Advanced Signal Processing Algorithms, Architectures, and Implementations III, (30 November 1992); doi: 10.1117/12.130927
Show Author Affiliations
Alle-Jan van der Veen, Delft Univ. of Technology (Netherlands)
Patrick W. Dewilde, Delft Univ. of Technology (Netherlands)

Published in SPIE Proceedings Vol. 1770:
Advanced Signal Processing Algorithms, Architectures, and Implementations III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top