A new numerically reliable computational approach is proposed to compute the factorization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved 'one-shot' methods which require the solution
Computation of normalized coprime factorizations of rational matrices
β Scribed by A. Varga
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 487 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An N-periodic discrete-time system in z-domain given by an N-periodic collection of rational matrices is considered. Doubly coprime decomposition of these matrices is studied. For such decompositions, the block-ordered concept is used. Further, the eight matrices in the generalized Bezout identity,
We give a frequency-domain approach to stabilization for a large class of systems with transfer functions involving fractional powers of s. A necessary and su cient criterion for BIBO stability is given, and it is shown how to construct coprime factorizations and associated BΓ ezout factors in order