A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
From MaRDI portal
Publication:3806682
DOI10.1137/0909059zbMath0658.65044OpenAlexW2047917018MaRDI QIDQ3806682
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909059
Frobenius normHamiltonian matrixbisection methodstable matrixdistance of a stable matrix to the unstable matrices
Related Items
Perturbation analysis for the sign functions of regular matrix pairs, Properties of linear approximations of matrices in the spectral norm, Some new results on stability robustness of two-dimensional discrete systems, Safety neighbournoods for the invariants of the matrix similarity∗, On the Stability Radius of Matrix Polynomials, A formula for computation of the real stability radius, Pseudospectra and stability radii for analytic matrix functions with application to time-delay systems, Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization, On the Closest Stable/Unstable Nonnegative Matrix and Related Stability Radii, Stability and distance to instability for polynomial matrix families. Complex perturbations, Robustness measures for linear systems with application to stability radii of Hurwitz and Schur polynomials, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, Approximation by matrices positive semidefinite on a subspace, A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems, Note on structured indefinite perturbations to Hermitian matrices, On the real stability radius of sparse systems, 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, On computing the distance to stability for matrices using linear dissipative Hamiltonian systems, Computing the distance to continuous-time instability of quadratic matrix polynomials, Robustness of uncertain descriptor systems, A new approach for calculating the real stability radius, Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation, Subspace method for the estimation of large-scale structured real stability radius, On Accuracy in Computational Control Problems, Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates, How to make the Perron eigenvector simple, On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods, Large-Scale Computation of $\mathcal{L}_\infty$-Norms by a Greedy Subspace Method, Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa, On the stability radius for linear time-delay systems, Numerical Rank Deficiency in Matrix Products, Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem, Ralph Byers 1955--2007, A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle, From pseudospectra of diagonal blocks to pseudospectrum of a full matrix, Maximal Acyclic Subgraphs and Closest Stable Matrices, Computation of extremum singular values and the strong \(H_\infty\) norm of SISO time-delay systems, Large-Scale and Global Maximization of the Distance to Instability, A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems, Calculating the \(H_\infty\) norm of a fractional system given in state-space form, A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process, Pseudospectra localizations and their applications, Level set methods for finding critical points of mountain pass type, A note on approximating the nearest stable discrete-time descriptor systems with fixed rank, Robust Stability of Differential-Algebraic Equations, An eigenvalue based approach for the robust stabilization of linear time-delay systems, A predictor-corrector type algorithm for the pseudospectral abscissa computation of time-delay systems, A Newton-based method for the calculation of the distance to instability, Structured Eigenvalue Problems, Perturbation of the matrix sign function, Positivity and linear matrix inequalities, Fractional pseudospectra and their localizations, Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius, Computing Closest Stable Nonnegative Matrix, Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations, On the Method by Rostami for Computing the Real Stability Radius of Large and Sparse Matrices, On the stability radius of a generalized state-space system, A global minimum search algorithm for estimating the distance to uncontrollability, Nearest \(\Omega \)-stable matrix via Riemannian optimization, Krylov subspace methods for discrete-time algebraic Riccati equations, Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability, Stability Radii for Linear Hamiltonian Systems with Dissipation Under Structure-Preserving Perturbations, On the stability of large matrices, On properties of univariate max functions at local maximizers, On Matrix Nearness Problems: Distance to Delocalization, Numerical methods in control, The stability robustness determination of state space models with real unstructured perturbations, Computation of the structured stability radius via matrix sign function, 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, Observers for Lipschitz non-linear systems
Uses Software
