arXiv Analytics

Sign in

arXiv:2403.08617 [math.NA]AbstractReferencesReviewsResources

A semidefinite programming characterization of the Crawford number

Shmuel Friedland, Cynthia Vinzant

Published 2024-03-13Version 1

We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within $\varepsilon$ precision is computable in polynomial time in the data and $|\log \varepsilon |$.

Comments: 8 pages
Categories: math.NA, cs.NA
Subjects: 15A60, 15A69, 68Q25, 68W25, 90C22, 90C51
Related articles: Most relevant | Search more
arXiv:2308.07287 [math.NA] (Published 2023-08-14)
On a semidefinite programming characterizations of the numerical radius and its dual norm
arXiv:2007.15044 [math.NA] (Published 2020-07-29)
Efficient algorithms for solving the $p$-Laplacian in polynomial time
arXiv:2205.13978 [math.NA] (Published 2022-05-27)
Exact bounds on the amplitude and phase of the interval discrete Fourier transform in polynomial time

Links

Toolbox