Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
From MaRDI portal
Publication:6105419
DOI10.1553/etna_vol58s402zbMath1524.65169arXiv1911.05136OpenAlexW2983039160MaRDI QIDQ6105419
Publication date: 9 June 2023
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.05136
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonsmooth optimization via quasi-Newton methods
- 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
- Computing stable eigendecompositions of matrices
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- A global minimum search algorithm for estimating the distance to uncontrollability
- A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian eigenvalue problems
- Approximation of pseudospectra of block triangular matrices
- Perturbation theory and backward error for \(AX - XB = C\)
- On the boundaries of strict pseudospectra
- On the numerical solution of \(AX-XB=C\)
- On a Perturbation Bound for Invariant Subspaces of Matrices
- Piecewise-smooth chebfuns
- An Algorithm to Compute {\boldmath{$\Sep_{\lambda}$}}
- Fast Methods for Estimating the Distance to Uncontrollability
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- On the Separation of Two Matrices
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Computation of Pseudospectra by Continuation
- An algorithm for computing the numerical radius
- Robust stability and a criss-cross algorithm for pseudospectra
- Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization
- Pseudospectral Components and the Distance to Uncontrollability
- A counterexample for two conjectures about stability
- New Methods for Estimating the Distance to Uncontrollability
- Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
- Optimal robustness of passive discrete-time systems
- Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius
- Optimal Robustness of Port-Hamiltonian Systems
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- <formula formulatype="inline"><tex Notation="TeX">${\cal L}_{\infty}$</tex></formula>-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- Computing the Kreiss Constant of a Matrix
- Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
This page was built for publication: Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
