Distance problems for linear dynamical systems
From MaRDI portal
Recommendations
- Distance problems for dissipative Hamiltonian systems and related matrix polynomials
- Estimating distances from quadruples satisfying stability properties to quadruples not satisfying them
- On the distance to uncontrollability and the distance to instability and their relation to some condition numbers in control
- The gap distance to the set of singular matrix pencils
- Algorithms for computing the distance to instability
Cited in
(19)- Hellinger distance estimation of nonlinear dynamical systems.
- The gap distance to the set of singular matrix pencils
- A note on an upper and a lower bound on sines between eigenspaces for regular Hermitian matrix pairs
- Distance problems for dissipative Hamiltonian systems and related matrix polynomials
- Computation of the nearest structured matrix triplet with common null space
- On the real stability radius of sparse systems
- Measuring the stability of spectral clustering
- Computing lower rank approximations of matrix polynomials
- The distance to strong stability
- scientific article; zbMATH DE number 2062313 (Why is no real title available?)
- Nearest linear systems with highly deficient reachable subspaces
- On the Nearest Singular Matrix Pencil
- Estimating distances from quadruples satisfying stability properties to quadruples not satisfying them
- Nearest rank deficient matrix polynomials
- Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils
- Stabilization of a matrix via a low-rank-adaptive ODE
- A Riemannian optimization method to compute the nearest singular pencil
- Structured linear stability problems
- A low-rank ODE for spectral clustering stability
This page was built for publication: Distance problems for linear dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950190)
