An experimental comparison of methods for computing the numerical radius

DOI10.1016/j.rinam.2024.100434arXiv2310.04646OpenAlexW4391375739MaRDI QIDQ6197617

Tim Mitchell, Michael L. Overton

Publication date: 20 March 2024

Published in: Results in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2310.04646

zbMATH Keywords

convex optimizationsemidefinite programmingnumerical rangenonconvex optimizationfield of values

Mathematics Subject Classification ID

Semidefinite programming (90C22) Numerical range, numerical radius (47A12) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for problems pertaining to operator theory (47-08)

Cites Work

• Unnamed Item
• A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
• Geometric computation of the numerical radius of a matrix
• On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
• Matrix Completions, Norms, and Hadamard Products
• Numerical Determination of the Field of Values of a General Complex Matrix
• An algorithm for computing the numerical radius
• Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks
• Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
• Über den Wertevorrat einer Matrix
• Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation