Fast stability tests for Hermitian matrix polynomials
From MaRDI portal
Cites work
- A sufficient condition for a polynomial to be stable
- Accuracy and Stability of Numerical Algorithms
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Block Kronecker Linearizations of Matrix Polynomials and their Backward Errors
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- Duality of matrix pencils, Wong chains and linearizations
- Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
- Linear Matrix Inequalities in System and Control Theory
- Locating eigenvalues of quadratic matrix polynomials
- Matrix Computations
- Matrix polynomials with spectral radius equal to the numerical radius
- Numerical Range of Matrix Polynomials
- On Criteria for Asymptotic Stability of Differential-Algebraic Equations
- Root polynomials and their role in the theory of matrix polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The Bezoutian and the eigenvalue-separation problem for matrix polynomials
- The boundary of the numerical range of matrix polynomials
- The computation of Kronecker's canonical form of a singular pencil
- The quadratic eigenvalue problem
- Total nonnegativity of finite Hurwitz matrices and root location of polynomials
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
This page was built for publication: Fast stability tests for Hermitian matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284143)