A new method for computing a column reduced polynomial matrix
From MaRDI portal
Recommendations
- Column reduction of polynomial matrices
- A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- scientific article; zbMATH DE number 708841
- Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
Cites work
- scientific article; zbMATH DE number 4016040 (Why is no real title available?)
- 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
- Numerical computation of a coprime factorization of a transfer function matrix
- The generalized eigenstructure problem in linear system theory
Cited in
(11)- Computing normal external descriptions and feedback design
- The RCH method for computing minimal polynomials of polynomial matrices
- Column reduction of polynomial matrices
- New method of minimal polynomial construction
- Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
- Normal forms for general polynomial matrices
- Computing minimal interpolation bases
- Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- Essentially optimal computation of the inverse of generic polynomial matrices
- The generalized Schur algorithm and some applications
This page was built for publication: A new method for computing a column reduced polynomial matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104046)
