{
  "annotation_id": "7bc2e99b-483f-484e-98b7-d62fbaf35f94",
  "date_created": "2026-03-02T18:01:24.775000Z",
  "date_modified": "2026-03-02T18:01:24.775000Z",
  "file_hash": "d0ba70ffccb71302323b891800cc2dc52027bc887aff9e47d162159e671620c4",
  "private": false,
  "record": {
    "abstract": "It is shown that MS Fortran-77 compilers allow to construct recursive\nsubroutines. The recursive one-dimensional adaptive quadrature subroutine is\nconsidered in particular. Despite its extremely short body (only eleven\nexecutable statements) the subroutine proved to be very effective and\ncompetitive. It was tested on various rather complex integrands. The\npossibility of function calls number minimization by choosing the optimal\nnumber of Gaussian abscissas is considered. The proposed recursive procedure\ncan be effectively applied for creating more sophisticated quadrature codes\n(one- or multi-dimensional) and easily incorporated into existing programs.",
    "arxiv_id": "physics/9905035",
    "authors": [
      "Andrei N. Berlizov",
      "Alexander A. Zhmudsky"
    ],
    "categories": [
      "physics.comp-ph"
    ],
    "title": "The recursive adaptive quadrature in MS Fortran-77",
    "url": "https://arxiv.org/abs/physics/9905035"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c070b369-19e0-4478-a7cb-2d41db4fdf27",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}