Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix

DOI10.1093/imanum/dri012zbMath1082.65043OpenAlexW2100004457MaRDI QIDQ5709021

Emre Mengi, Michael L. Overton

Publication date: 21 November 2005

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/dri012

zbMATH Keywords

convergencenumerical examplerobust stabilityHamiltonian matricesdiscrete-time dynamical systemsymplectic pencils

Mathematics Subject Classification ID

Related Items (21)

Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems ⋮ Continuous approximation of linear impulsive systems and a new form of robust stability ⋮ ADER methods for hyperbolic equations with a time-reconstruction solver for the generalized Riemann problem: the scalar case ⋮ Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation ⋮ Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates ⋮ Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration ⋮ An experimental comparison of methods for computing the numerical radius ⋮ Eigenvalue characterization of some structured matrix pencils under linear perturbation ⋮ Numerical radius for the asymptotic stability of delay differential equations ⋮ A Support Function Based Algorithm for Optimization with Eigenvalue Constraints ⋮ Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks ⋮ Level set methods for finding critical points of mountain pass type ⋮ Robust Stability of Differential-Algebraic Equations ⋮ Approximating the leading singular triplets of a large matrix function ⋮ Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius ⋮ Nearest \(\Omega \)-stable matrix via Riemannian optimization ⋮ Non-normal stability of embedded boundary methods through pseudospectra ⋮ Geometric computation of the numerical radius of a matrix ⋮ On properties of univariate max functions at local maximizers ⋮ On Matrix Nearness Problems: Distance to Delocalization ⋮ A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles

This page was built for publication: Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix