{
  "annotation_id": "ad7678b4-b751-40fb-b22d-c4a6e1c42f4a",
  "date_created": "2026-03-02T18:01:21.520000Z",
  "date_modified": "2026-03-02T18:01:21.520000Z",
  "file_hash": "e7facc22886d4f3a9ecb64c9097e9a3f9048234485aba20ed182efe8fb5909ef",
  "private": false,
  "record": {
    "abstract": "Finite precision computations using digital computers involve the following\ninherent errors: (1) Round-off error of finite precision computations (2)\nBinary computer arithmetic precludes exact number representation of traditional\ndecimal system used in data input stage to the computer. Though the round-off\nerror is as small as in the seventh decimal place (single precision) in the\nbeginning, it can enter the mainstream computation within 50 iterations in\niterative computations, such as that used in numerical integration schemes, for\nexample, the commonly used fourth order Runge-Kutta method. Growth of round-off\nerror in recursive vis-a-vis iterative computing is described in the text. In\nthis paper several computational experiments are presented to demonstrate the\nrapid growth of round-off error in iterative computations.",
    "arxiv_id": "physics/9807003",
    "authors": [
      "Suvarna Fadnavis"
    ],
    "categories": [
      "physics.comp-ph",
      "physics.ao-ph"
    ],
    "title": "Some Numerical Experiments on Round-off Error Growth in Finite Precision   Numerical Computation",
    "url": "https://arxiv.org/abs/physics/9807003"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "28c9212d-139d-4d85-ad3f-45ae2f03ab44",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}