{
  "id": "2403.08617",
  "version": "v1",
  "published": "2024-03-13T15:30:54.000Z",
  "updated": "2024-03-13T15:30:54.000Z",
  "title": "A semidefinite programming characterization of the Crawford number",
  "authors": [
    "Shmuel Friedland",
    "Cynthia Vinzant"
  ],
  "comment": "8 pages",
  "categories": [
    "math.NA",
    "cs.NA"
  ],
  "abstract": "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 |$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-03-13T15:30:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "15A60",
      "15A69",
      "68Q25",
      "68W25",
      "90C22",
      "90C51"
    ],
    "keywords": [
      "semidefinite programming characterization",
      "crawford number",
      "polynomial time"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}