An algorithm for coprime matrix fraction description using Sylvester matrices

DOI10.1016/S0024-3795(96)00636-2zbMath0886.65042MaRDI QIDQ1372963

Basil Kouvaritakis, João Carlos Basilio

Publication date: 13 April 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

numerical examplessingular value decompositionpolynomial matricesSylvester matrixcoprime matrix fraction descriptioncoprime polynomial factorizationtransfer function matrices

Mathematics Subject Classification ID

Related Items (6)

An explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment ⋮ Parametric solutions to Sylvester-conjugate matrix equations ⋮ Numerical computation of minimal polynomial bases: a generalized resultant approach ⋮ Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control ⋮ A robust solution of the generalized polynomial Bézout identity ⋮ Inversion of polynomial matrices via state-space

Cites Work

• Unnamed Item
• Unnamed Item
• Fast projection methods for minimal design problems in linear system theory
• Linear multivariable systems
• Multivariable stable generalised predictive control
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Computation of matrix fraction descriptions of linear time-invariant systems
• Coprime matrix fraction description via orthogonal structure theorem
• Generalized Bezoutian and Sylvester matrices in multivariable linear control
• Modern Wiener-Hopf design of optimal controllers--Part II: The multivariable case
• A minimization algorithm for the design of linear multivariable systems

This page was built for publication: An algorithm for coprime matrix fraction description using Sylvester matrices