Computing the distance to continuous-time instability of quadratic matrix polynomials
From MaRDI portal
Publication:2184730
DOI10.1007/s00211-020-01108-0zbMath1440.65049MaRDI QIDQ2184730
Alexander N. Malyshev, Miloud Sadkane
Publication date: 29 May 2020
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11250/2765977
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65G50: Roundoff error
65F35: Numerical computation of matrix norms, conditioning, scaling
15A22: Matrix pencils
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Newton-based method for the calculation of the distance to instability
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- Stability radii of linear systems
- Real and complex stability radii of polynomial matrices
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- 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
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- Robust stability of linear systems described by higher-order dynamic equations
- Mathematical Systems Theory I
- NLEVP
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- Vector Spaces of Linearizations for Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- An Algorithm for Generalized Matrix Eigenvalue Problems
