An Algorithm for Computing the Distance to Instability
From MaRDI portal
Recommendations
Cited in
(19)- Fractional pseudospectra and their localizations
- Nearest -stable matrix via Riemannian optimization
- From pseudospectra of diagonal blocks to pseudospectrum of a full matrix
- Computing the threshold of the influence of intercellular nanotubes on cell-to-cell communication integrity
- Stability radii for real linear Hamiltonian systems with perturbed dissipation
- Irr: An algorithm for computing the smallest singular value of large scale matrices
- Algorithms for computing the distance to instability
- Stability radii for linear Hamiltonian systems with dissipation under structure-preserving perturbations
- A subspace method for large-scale eigenvalue optimization
- A new approach for calculating the real stability radius
- On the Stability Radius of Matrix Polynomials
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
- Robust stability of differential-algebraic equations
- Stability and distance to instability for polynomial matrix families. Complex perturbations
- On matrix nearness problems: distance to delocalization
- Pseudospectra localizations and their applications.
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- A Newton-based method for the calculation of the distance to instability
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
This page was built for publication: An Algorithm for Computing the Distance to Instability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243495)