DocumentCode
1918761
Title
Computing minimal partial realizations via a Lanczos-type algorithm for multiple starting vectors
Author
Freund, Roland W.
Author_Institution
Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA
Volume
5
fYear
1997
fDate
10-12 Dec 1997
Firstpage
4394
Abstract
We describe a Lanczos-type procedure that reduces a given realization of a finite sequence of (moment) matrices to a minimal partial realization. A key feature of this procedure is that the underlying Lanczos-type algorithm is directly applied to the matrix triplet describing the given realization, rather than to the moment matrices. It thus avoids explicit formulation of and the usually unstable computation with the moment matrices
Keywords
iterative methods; linear systems; matrix algebra; vectors; Krylov subspace; Lanczos-type algorithm; iterative methods; linear dynamical systems; matrix algebra; minimal partial realizations; multiple starting vectors; Circuit simulation; Large-scale systems; Linear systems; Matrix decomposition; Reduced order systems; Robustness; Sparse matrices; Transfer functions; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1997., Proceedings of the 36th IEEE Conference on
Conference_Location
San Diego, CA
ISSN
0191-2216
Print_ISBN
0-7803-4187-2
Type
conf
DOI
10.1109/CDC.1997.649603
Filename
649603
Link To Document