{
  "annotation_id": "585f894b-b3dd-477c-84a8-fb25f6bbc1a4",
  "date_created": "2026-03-02T18:01:21.746000Z",
  "date_modified": "2026-03-02T18:01:21.746000Z",
  "file_hash": "5a50301a5d92fd3616325b8303d5881dff0b9eae1f6bb9208239b585e593f250",
  "private": false,
  "record": {
    "abstract": "We present a parallel version of the well-known Split-Step Fourier method\n(SSF) for solving the Nonlinear Schr\\\"odinger equation, a mathematical model\ndescribing wave packet propagation in fiber optic lines. The algorithm is\nimplemented under both distributed and shared memory programming paradigms on\nthe Silicon Graphics/Cray Research Origin 200. The 1D Fast-Fourier Transform\n(FFT) is parallelized by writing the 1D FFT as a 2D matrix and performing\nindependent 1D sequential FFTs on the rows and columns of this matrix. We can\nattain almost perfect speedup in SSF for small numbers of processors depending\non both problem size and communication contention. The parallel algorithm is\napplicable to other computational problems constrained by the speed of the 1D\nFFT.",
    "arxiv_id": "physics/9711012",
    "authors": [
      "S. M. Zoldi",
      "V. Ruban",
      "A. Zenchuk",
      "S. Burtsev"
    ],
    "categories": [
      "physics.comp-ph",
      "nlin.PS",
      "patt-sol"
    ],
    "title": "Parallel Implementations of the Split-Step Fourier Method for Solving   Nonlinear Schr\\\"odinger Systems",
    "url": "https://arxiv.org/abs/physics/9711012"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "da0121a6-fc4d-4762-90bc-d876a168f752",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}