A robust solution of the generalized polynomial Bézout identity

DOI10.1016/j.laa.2003.11.030zbMath1056.65038OpenAlexW1984423026MaRDI QIDQ1827508

João Carlos Basilio, Marcos Vicente Moreira

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.laa.2003.11.030

zbMATH Keywords

numerical examplesrobust algorithmsingular value decompositionsmatrix fraction descriptiongeneralized Bézout identitymatrix polynomials, minimal polynomial basis

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Matrices over function rings in one or more variables (15A54)

Related Items

All doubly coprime factorizations of a general rational matrix ⋮ Rational stabilising commutative controllers: parameterisation and characterisation of degrees of freedom ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ The generalized Schur algorithm and some applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast projection methods for minimal design problems in linear system theory
• Linear multivariable systems
• An algorithm for coprime matrix fraction description using Sylvester matrices
• Inversion of polynomial matrices via state-space
• Numerical operations with polynomial matrices
• An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)
• A novel approach for solving Diophantine equations
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• The solution of the matrix polynomial equation<tex>A(s)X(s) + B(s)Y(s) = C(s)</tex>
• A new method for solving the polynomial generalized Bezout identity
• Characteristic frequency-gain design study of an automatic flight control system
• A normalizing precompensator for the design of effective and reliable commutative controllers
• On solving Diophantine equations by real matrix manipulation