Computing the distance to continuous-time instability of quadratic matrix polynomials
From MaRDI portal
Publication:2184730
Recommendations
- A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle
- On the computation of the distance to quadratic matrix polynomials that are singular at some points on the unit circle
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- A Newton-based method for the calculation of the distance to instability
- Locating eigenvalues of quadratic matrix polynomials
Cites work
- A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A Newton-based method for the calculation of the distance to instability
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- scientific article; zbMATH DE number 3920686 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Mathematical Systems Theory I
- NLEVP, a collection of nonlinear eigenvalue problems
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- On the computation of the distance to quadratic matrix polynomials that are singular at some points on the unit circle
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- Real and complex stability radii of polynomial matrices
- Robust stability of linear systems described by higher-order dynamic equations
- Stability radii of linear systems
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Vector Spaces of Linearizations for Matrix Polynomials
Cited in
(6)- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- On the computation of the distance to quadratic matrix polynomials that are singular at some points on the unit circle
- A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle
- Prime decomposition of quadratic matrix polynomials
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- On the stability radius for linear time-delay systems
This page was built for publication: Computing the distance to continuous-time instability of quadratic matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184730)
