A robust solution of the generalized polynomial Bézout identity
DOI10.1016/J.LAA.2003.11.030zbMATH Open1056.65038OpenAlexW1984423026MaRDI QIDQ1827508FDOQ1827508
Authors: J. C. Basilio, M. V. 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
Recommendations
- A new method for solving the polynomial generalized Bezout identity
- scientific article; zbMATH DE number 2111769
- Generalizations of some results on generalized polynomial identities
- scientific article; zbMATH DE number 5214952
- scientific article
- A new approach to Bezout equations derived from multivariate polynomial matrices and real entire functions
- On the polynomial solutions of general polynomial differential equations
- Bézoutians of polynomial matrices and their generalized inverses
- Generalized polynomial bases and the Bézoutian
- Bezout equations over bivariate polynomial matrices related by an entire function
numerical examplesmatrix fraction descriptionsingular value decompositionsrobust algorithmmatrix polynomials, minimal polynomial basisgeneralized Bézout identity
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Matrices over function rings in one or more variables (15A54)
Cites Work
- Title not available (Why is that?)
- 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?)
- Numerical operations with polynomial matrices
- An algorithm for solving the matrix polynomial equation B(s)D(s)+A(s)N(s)=H(s)
- On solving Diophantine equations by real matrix manipulation
- A novel approach for solving Diophantine equations
- The solution of the matrix polynomial equation<tex>A(s)X(s) + B(s)Y(s) = C(s)</tex>
- Inversion of polynomial matrices via state-space
- An algorithm for coprime matrix fraction description using Sylvester matrices
- 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
Cited In (5)
- A new method for solving the polynomial generalized Bezout identity
- 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
This page was built for publication: A robust solution of the generalized polynomial Bézout identity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827508)
