On the choice of an optimal interpolation point in Krylov-based order reduction

In this paper, the well-known problem of finding a suitable interpolation point in order reduction via moment matching by Krylov subspaces is investigated. By using the equivalence property of moment matching and Laguerre-based order reduction, the problem is reformulated as finding the best choice...

Full description

Saved in:
Bibliographic Details
Main Authors: Salimbahrami, B., Eid, R., Lohmann, B.
Format: Conference Proceeding
Language:English
Subjects:
Cost function
Frequency domain analysis
Interpolation
Iterative algorithms
Large-scale systems
Optimal control
Reduced order systems
Signal processing algorithms
Systems engineering and theory
Time domain analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, the well-known problem of finding a suitable interpolation point in order reduction via moment matching by Krylov subspaces is investigated. By using the equivalence property of moment matching and Laguerre-based order reduction, the problem is reformulated as finding the best choice for the free parameter ¿ in the Laguerre basis. Minimizing appropriate cost functions with very few iterations is the key point toward finding this best interpolation point.
ISSN:0191-2216
DOI:10.1109/CDC.2008.4739219