A polynomial matrix method for computing stable rational doubly coprime factorizations

DOI10.1016/0167-6911(90)90023-NzbMath0699.93037OpenAlexW1979843501WikidataQ114214957 ScholiaQ114214957MaRDI QIDQ913730

Kenji Sugimoto, Yutaka Yamamoto

Publication date: 1990

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(90)90023-n

zbMATH Keywords

identityBezoutfractional representationpolynomial matrix methodstable rational doubly coprime factorizations

Mathematics Subject Classification ID

Factorization of matrices (15A23) Linear systems in control theory (93C05) Algebraic methods (93B25)

Related Items (1)

The design of linear controllers with symbolic algebra

Cites Work

• Unnamed Item
• Unnamed Item
• A course in \(H_{\infty}\) control theory
• Numerical computation of a coprime factorization of a transfer function matrix
• On doubly coprime factorizations
• Fast projection methods for minimal design problems in linear system theory
• Linear multivariable systems
• Proper stable transfer matrix factorizations and internal system descriptions
• A connection between state-space and doubly coprime fractional representations
• A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
• Parameterization of the full-order compensator in the frequency domain
• A fast algorithm for the division of two polynomial matrices

This page was built for publication: A polynomial matrix method for computing stable rational doubly coprime factorizations