An algorithm for coprime matrix fraction description using Sylvester matrices
DOI10.1016/S0024-3795(96)00636-2zbMATH Open0886.65042MaRDI QIDQ1372963FDOQ1372963
Authors: J. C. Basilio, Basil Kouvaritakis 
Publication date: 13 April 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Coprime matrix fraction description via orthogonal structure theorem
- Numerical computation of a coprime factorization of a transfer function matrix
- scientific article; zbMATH DE number 775611
- Minimal bases of matrix pencils and coprime matrix fraction descriptions
- Coprime factorizations of multivariate rational matrices
numerical examplessingular value decompositionpolynomial matricesSylvester matrixcoprime matrix fraction descriptioncoprime polynomial factorizationtransfer function matrices
Matrix equations and identities (15A24) Matrices over function rings in one or more variables (15A54)
Cites Work
- Fast projection methods for minimal design problems in linear system theory
- Linear multivariable systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multivariable stable generalised predictive control
- Modern Wiener-Hopf design of optimal controllers--Part II: The multivariable case
- Computation of matrix fraction descriptions of linear time-invariant systems
- Generalized Bezoutian and Sylvester matrices in multivariable linear control
- A minimization algorithm for the design of linear multivariable systems
- Coprime matrix fraction description via orthogonal structure theorem
Cited In (9)
- A recursive algorithm for coprime fractions and Diophantine equations
- A robust solution of the generalized polynomial Bézout identity
- Minimal bases of matrix pencils and coprime matrix fraction descriptions
- Inversion of polynomial matrices via state-space
- Coprime matrix fraction description via orthogonal structure theorem
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
- 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
This page was built for publication: An algorithm for coprime matrix fraction description using Sylvester matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372963)
