{
  "annotation_id": "46b03b94-4080-4d2c-bfb2-1b9eeb7e5701",
  "date_created": "2026-03-02T18:00:42.408000Z",
  "date_modified": "2026-03-02T18:00:42.408000Z",
  "file_hash": "4bb2d75adb3bbcbaf039c03d1daf5167ce9f082bb618650ab59a74c512c12bb6",
  "private": false,
  "record": {
    "abstract": "We present an efficient and parsimonious algorithm to solve mixed\ninitial/final-value problems. The algorithm optimally limits the memory storage\nand the computational time requirements: with respect to a simple forward\nintegration, the cost factor is only logarithmic in the number of time-steps.\nAs an example, we discuss the solution of the final-value problem for a\nFokker-Planck equation whose drift velocity solves a different initial-value\nproblem -- a relevant issue in the context of turbulent scalar transport.",
    "arxiv_id": "physics/0305058",
    "authors": [
      "Antonio Celani",
      "Massimo Cencini",
      "Alain Noullez"
    ],
    "categories": [
      "physics.comp-ph",
      "nlin.CD",
      "physics.flu-dyn"
    ],
    "doi": "10.1016/j.physd.2004.04.001",
    "title": "Going forth and back in time: a fast and parsimonious algorithm for   mixed initial/final-value problems",
    "url": "https://arxiv.org/abs/physics/0305058"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a80ff290-82ad-4815-ad3e-45e0a85ac9a6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}