It has been experimentally verified that most commonly used subspace methods for identification of linear state-space systems with exogenous inputs may, in certain experimental conditions, run into ill-conditioning and lead to ambiguous results. An analysis of the critical situations has lead us to propose a new algorithmic structure which could be used either to test difficult cases and/or to implement a suitable combination of new and old algorithms presented in the literature to help fixing the problem.
Some Algorithmic aspects of Subspace Identification with Inputs
CHIUSO, ALESSANDRO;PICCI, GIORGIO
2001
Abstract
It has been experimentally verified that most commonly used subspace methods for identification of linear state-space systems with exogenous inputs may, in certain experimental conditions, run into ill-conditioning and lead to ambiguous results. An analysis of the critical situations has lead us to propose a new algorithmic structure which could be used either to test difficult cases and/or to implement a suitable combination of new and old algorithms presented in the literature to help fixing the problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.