{
  "id": "1807.01382",
  "version": "v1",
  "published": "2018-07-03T22:17:07.000Z",
  "updated": "2018-07-03T22:17:07.000Z",
  "title": "A simplex algorithm for rational CP-factorization",
  "authors": [
    "Mathieu Dutour Sikirić",
    "Achill Schürmann",
    "Frank Vallentin"
  ],
  "comment": "15 pages",
  "categories": [
    "math.OC",
    "math.NT"
  ],
  "abstract": "In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-07-03T22:17:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "rational cp-factorization",
      "simplex algorithm",
      "determines"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}