Numerical computation of minimal polynomial bases: a generalized resultant approach
A new resultant based method for the computation of minimal polynomial bases of a polynomial matrix is proposed. The algorithm utilizes the left null space structure of successive generalized Sylvester resultants of a polynomial matrix to obtain the coefficients of the minimal polynomial bases of the left kernel of the given polynomial matrix. The entire procedure can be implemented using only orthogonal decompositions and the coefficients of the resulting minimal polynomial basis have the appealing property of being orthonomal.
- Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- On the computation of the minimal polynomial of a polynomial matrix
- A new method for computing a column reduced polynomial matrix
- Computing minimal nullspace bases
- A new method for computing a column reduced polynomial matrix
- An algorithm for coprime matrix fraction description using Sylvester matrices
- Column reduction of polynomial matrices
- Convolution Feedback Systems
- Design of unity feedback systems to achieve arbitrary denominator matrix
- Fast projection methods for minimal design problems in linear system theory
- Generalized state-space realizations from matrix fraction descriptions
- Greatest common divisor via generalized Sylvester and Bezout matrices
- scientific article; zbMATH DE number 49560 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Linear multivariable systems
- Minimal bases of matrix pencils and coprime matrix fraction descriptions
- Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Numerical computation of a coprime factorization of a transfer function matrix
- On some properties of the minimal-in-degree irreducible factorizations of a rational matrix
- On the computation and parametrization of proper denominator assigning compensators for strictly proper plants
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- A new method for computing a column reduced polynomial matrix
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- Algorithm for computing \(\mu\)-bases of univariate polynomials
- Algorithms for finding the minimal polynomials and inverses of resultant matrices
- Robustness and perturbations of minimal bases
- On computing root polynomials and minimal bases of matrix pencils
- The generalized Schur algorithm and some applications
- The RCH method for computing minimal polynomials of polynomial matrices
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- On computing minimal proper nullspace bases with applications in fault detection
- On the computation of the minimal polynomial of a polynomial matrix
- Minimal indices and minimal bases via filtrations
- New method of minimal polynomial construction
- Computing minimal nullspace bases
- Eigenvectors and minimal bases for some families of Fiedler-like linearizations
- Minimal rank factorizations of polynomial matrices
- Equi-affine minimal-degree moving frames for polynomial curves
This page was built for publication: Numerical computation of minimal polynomial bases: a generalized resultant approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484243)
