An algorithm for computing the numerical radius
From MaRDI portal
Publication:4344265
DOI10.1093/imanum/17.3.329zbMath0880.65019OpenAlexW2045946397MaRDI QIDQ4344265
Chunyang He, G. Alistair Watson
Publication date: 8 January 1998
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/17.3.329
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Computing the field of values and pseudospectra using the Lanczos method with continuation ⋮ 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 ⋮ The nearest definite pair for the Hermitian generalized eigenvalue problem ⋮ Geometric computation of the numerical radius of a matrix ⋮ A Subspace Method for Large-Scale Eigenvalue Optimization
This page was built for publication: An algorithm for computing the numerical radius
