An Algorithm for Computing the Distance to Instability
From MaRDI portal
Publication:4243495
DOI10.1137/S0895479897314838zbMath0927.65055OpenAlexW1988732861MaRDI QIDQ4243495
Chunyang He, G. Alistair Watson
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479897314838
algorithmeigenvaluesstable matricesHamiltonian matrixinverse iterationsmallest singular valuedistance to instabilityBrusselator reactionglobal minimum searchingOrr-Sommerfeld planar flow equation
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) System identification (93B30)
Related Items (16)
On the Stability Radius of Matrix Polynomials ⋮ Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization ⋮ Stability and distance to instability for polynomial matrix families. Complex perturbations ⋮ 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 ⋮ A new approach for calculating the real stability radius ⋮ From pseudospectra of diagonal blocks to pseudospectrum of a full matrix ⋮ Irr: An algorithm for computing the smallest singular value of large scale matrices ⋮ Pseudospectra localizations and their applications ⋮ Robust Stability of Differential-Algebraic Equations ⋮ A Newton-based method for the calculation of the distance to instability ⋮ Fractional pseudospectra and their localizations ⋮ Nearest \(\Omega \)-stable matrix via Riemannian optimization ⋮ Stability Radii for Linear Hamiltonian Systems with Dissipation Under Structure-Preserving Perturbations ⋮ On Matrix Nearness Problems: Distance to Delocalization ⋮ A Subspace Method for Large-Scale Eigenvalue Optimization
This page was built for publication: An Algorithm for Computing the Distance to Instability
