Computing the numerical radius
From MaRDI portal
Publication:1908194
DOI10.1016/0024-3795(94)00097-2zbMath0848.65030OpenAlexW2085111871MaRDI QIDQ1908194
Publication date: 7 October 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00097-2
largest eigenvalueHermitian matrixpower methodnumerical radiuscomplex matrixmatrix-vector multiplicationscomputational tests
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Computing the field of values and pseudospectra using the Lanczos method with continuation ⋮ Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation ⋮ Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration ⋮ Numerical radius for the asymptotic stability of delay differential equations ⋮ Computational geometry of positive definiteness ⋮ The nearest definite pair for the Hermitian generalized eigenvalue problem ⋮ Approximating the leading singular triplets of a large matrix function ⋮ Geometric computation of the numerical radius of a matrix ⋮ Finding norms of Hadamard multipliers
Cites Work
- Unnamed Item
- Unnamed Item
- On the numerical radius and its applications
- On certain finite dimensional numerical ranges and numerical radii†
- Matrix Analysis
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Large-Scale Optimization of Eigenvalues
- Matrix Completions, Norms, and Hadamard Products
- On the numerical radius of matrices and its application to iterative solution methods
This page was built for publication: Computing the numerical radius
