In this paper, various techniques for random generation of stable polynomials in discrete and continuous time are considered and presented in a unified framework. An attempt is made to present our "global vision" of the potentials of random generation techniques for stable polynomials. Moreover, their properties are discussed and compared, with a particular attention to the MATLAB implementation issues. Possible applications are indicated and illustrative results of simulations are provided.
On Random Generation of Stable Polynomials
Dabbene F
2009
Abstract
In this paper, various techniques for random generation of stable polynomials in discrete and continuous time are considered and presented in a unified framework. An attempt is made to present our "global vision" of the potentials of random generation techniques for stable polynomials. Moreover, their properties are discussed and compared, with a particular attention to the MATLAB implementation issues. Possible applications are indicated and illustrative results of simulations are provided.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
