We make an experimental comparison of methods for computing the numerical radius of an $n\times 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^{2}+1$ real variables. We make comparisons with respect to both accuracy and computation time using publicly available software.

翻译：我们基于两个著名刻画对计算$n\times n$复矩阵数值半径的方法进行了实验比较：第一个是单实变量的非凸优化问题，第二个是$n^2+1$个实变量的凸优化问题。我们使用公开可用的软件，在精度和计算时间两方面进行了比较。