{
  "id": "1606.00721",
  "version": "v1",
  "published": "2016-06-02T15:31:56.000Z",
  "updated": "2016-06-02T15:31:56.000Z",
  "title": "Decomposition of stencil update formula into atomic stages",
  "authors": [
    "Qiqi Wang"
  ],
  "categories": [
    "math.NA"
  ],
  "abstract": "In parallel solution of partial differential equations, a complex stencil update formula that accesses multiple layers of neighboring grid points sometimes must be decomposed into atomic stages, ones that accesses only immediately neighboring grid points. This paper shows that an optimal decomposition can be computed by solving the dual of a minimum-cost network flow problem.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-06-02T15:31:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "65M06",
      "68W10",
      "90C35",
      "90C90"
    ],
    "keywords": [
      "atomic stages",
      "decomposition",
      "minimum-cost network flow problem",
      "complex stencil update formula",
      "accesses multiple layers"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}