An Experimental Comparison of Methods for Computing the Numerical Radius

2023/10/07 by Mitchell, Tim, Overton, Michael L.
#15A60 #90C22 #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2310.04646

Abstract

We make an experimental comparison of methods for computing the numerical radius of an n× n complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a convex optimization problem in n²+1 real variables. We make comparisons with respect to both accuracy and computation time using publicly available software.

Related

• On the numerical radii of 2×2 complex matrices
• Advanced Refinements of Numerical Radius Inequalities
• Convergence rate analysis and improved iterations for numerical radius computation
• On the numerical radius of matrices and its application to iterative solution methods
• Elevating Precision in Inequalities for Numerical Radii and Operator Matrices