An experimental comparison of methods for computing the numerical radius

被引：1
|
作者：
Mitchell, Tim [1 ]
Overton, Michael L. [2 ]
机构：
[1] CUNY Queens Coll, Dept Comp Sci, 65-30 Kissena Blvd, Flushing, NY 11367 USA
[2] NYU, Courant Inst Math Sci, 251 Mercer St, New York, NY 10012 USA
来源：
RESULTS IN APPLIED MATHEMATICS | 2024年 / 21卷
基金：
美国国家科学基金会;
关键词：
Semidefinite programming; Convex optimization; Nonconvex optimization; Field of values; Numerical range; VALUES; ALGORITHM; MATRIX;
D O I：
10.1016/j.rinam.2024.100434
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We make an experimental comparison of methods for computing the numerical radius of an n x 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.
引用
收藏
页数：4
相关论文
共 50 条
12345