A semidefinite programming characterization of the Crawford number
Numerical Analysis
2026-03-04 v2 Numerical Analysis
Abstract
We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within precision is computable in polynomial time in the data and .
Cite
@article{arxiv.2403.08617,
title = {A semidefinite programming characterization of the Crawford number},
author = {Shmuel Friedland and Cynthia Vinzant},
journal= {arXiv preprint arXiv:2403.08617},
year = {2026}
}
Comments
7 pages, revised version, to appear in Pure and Applied Functional Analysis, ISSN 2189-3756 (PRINT) ISSN 2189-3764 (ONLINE)