An algorithm for computing the numerical radius
Let \(A\) be an \(n\times n\) matrix with complex entries; the numerical range \(F(A)\) is given by \[ F(A)=\{z^*Az:z\in\mathbb{C}^n,\;z^*z=1\} \] and the numerical radius is therefore defined by \[ r(A)=\max\{|w|: w\in F(A)\}. \] This is an important quantity in the analysis of convergence of numerical processes. Using a technique which is analogous to a bisection method for computing the distance to instability in control problems the authors give an iterative process which successively refines lower and upper bounds for the numerical radius. The presented method is essentially for matrices of dimension less than 300.
- Computing the numerical radius
- A generalization of the numerical radius
- An algorithm to compute circumscription
- Geometric computation of the numerical radius of a matrix
- The weighted numerical radius
- An algorithm to find the number of the digitizations of discs with a fixed radius
- An algorithm for computing the distance between two circular disks
- Algorithm to compute the complex stability radius
- Best approximation in numerical radius
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- Geometric computation of the numerical radius of a matrix
- Matrix valued versions of a result of von Neumann with an application to time discretization
- Computing the numerical radius
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- The nearest definite pair for the Hermitian generalized eigenvalue problem
- An algorithm for finding a 2-similarity transformation from a numerical contraction to a contraction
- A subspace method for large-scale eigenvalue optimization
- An algorithm to find the number of the digitizations of discs with a fixed radius
- On the numerical radius of matrices and its application to iterative solution methods
- Numerical radius for the asymptotic stability of delay differential equations
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- 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
- Computing the quadratic numerical range
- Spectral dynamics of natural and forced supersonic twin-rectangular jet flow
- Some counterexamples related to sectorial matrices and matrix phases
This page was built for publication: An algorithm for computing the numerical radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344265)