Computing the numerical radius

DOI10.1016/0024-3795(94)00097-2MaRDI QIDQ1908194zbMATHOpenAlexFDO

Authors G. A. Watson

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

zbMATH Keywords

Hermitian matrixlargest eigenvaluenumerical radiuspower methodcomplex matrixmatrix-vector multiplicationscomputational tests

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Recommendations

• An algorithm for computing the numerical radius
• Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
• Geometric computation of the numerical radius of a matrix
• Fast methods for computing the \(p\)-radius of matrices
• On the numerical radius of matrices and its application to iterative solution methods

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• Large-Scale Optimization of Eigenvalues
• Matrix Analysis
• Matrix Completions, Norms, and Hadamard Products
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• On certain finite dimensional numerical ranges and numerical radii^†
• On the numerical radius and its applications
• On the numerical radius of matrices and its application to iterative solution methods

Cited in

(12)

• Geometric computation of the numerical radius of a matrix
• An algorithm for computing the numerical radius
• Computational geometry of positive definiteness
• Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
• Computing the field of values and pseudospectra using the Lanczos method with continuation
• The nearest definite pair for the Hermitian generalized eigenvalue problem
• Numerical radius for the asymptotic stability of delay differential equations
• Approximating the leading singular triplets of a large matrix function
• An experimental comparison of methods for computing the numerical radius
• Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
• An algorithm for finding a 2-similarity transformation from a numerical contraction to a contraction
• Finding norms of Hadamard multipliers

This page was built for publication: Computing the numerical radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908194)