Reliable numerical methods for polynomial matrix triangularization
DOI10.1109/9.751344zbMATH Open0956.65036OpenAlexW2038130734MaRDI QIDQ4506705FDOQ4506705
Authors: Michael Sebek, Didier Henrion 
Publication date: 17 October 2000
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.751344
Recommendations
- On the numerical solution of matrix polynomial equations
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- Structured matrix methods for polynomial root-finding
- Numerical stabilization of polynomial and matrix
- Triangularizing matrix polynomials
- Stability of triangularization of polynomial matrices
- scientific article; zbMATH DE number 3923971
- Efficient evaluation of matrix polynomials
- Matrix methods for computing the values of a multivariable polynomial
algorithmsinterpolationpolynomial matricesring of polynomialsSylvester matricestriangularization methodspolynomial fractionsgreatest common divisor extractionpolynomial null-space computationpolynomial rank evaluation
Cited In (9)
- A Toeplitz algorithm for polynomial \(J\)-spectral factorization
- Discrete-time symmetric polynomial equations with complex coefficients.
- Spectral factorization of non-symmetric polynomial matrices
- Implicitization of rational hypersurfaces via linear syzygies: a practical overview
- Revisiting the Matrix Polynomial Greatest Common Divisor
- A numerical elimination method for polynomial computations
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- A coprime factorisation and its application in \({\mathcal H}_2\) control
- Stability of triangularization of polynomial matrices
Uses Software
This page was built for publication: Reliable numerical methods for polynomial matrix triangularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4506705)
