Parallel Implementations of the Split-Step Fourier Method for Solving Nonlinear Schrödinger Systems
S. M. Zoldi, V. Ruban, A. Zenchuk, S. Burtsev
Abstract
We present a parallel version of the well-known Split-Step Fourier method (SSF) for solving the Nonlinear Schrödinger equation, a mathematical model describing wave packet propagation in fiber optic lines. The algorithm is implemented under both distributed and shared memory programming paradigms on the Silicon Graphics/Cray Research Origin 200. The 1D Fast-Fourier Transform (FFT) is parallelized by writing the 1D FFT as a 2D matrix and performing independent 1D sequential FFTs on the rows and columns of this matrix. We can attain almost perfect speedup in SSF for small numbers of processors depending on both problem size and communication contention. The parallel algorithm is applicable to other computational problems constrained by the speed of the 1D FFT.
Create a lesson
Related papers
Identifying the Shear Piezoelectric Coefficient using Physics-Informed Neural Networks under Exact Boundary and Initial Constraints
Suhas Suresh Bharadwaj
Fracture-Bench: A Controlled Benchmark Suite for Machine Learning Surrogates in Phase-Field Fracture Mechanics
Meenu Krishnan U., Maryam Hakimzadeh, Indrashish Saha et al.
Noise-resilient collective order through temporal memory in self-propelled particles
Mihir Durve, Sauro Succi, Antonio Celani
Site-orbit masked twin-branch Transformer for symmetry-constrained crystal generation
Junchi Liu, Haoran Si, Luo Yan et al.
Maximal correlation and optimal transformations of probability distributions in tensor-train format: a variational algorithm
Kayo Kinjo, Jun Ohkubo
Quantum simulation of dissipative acoustic and elastic waves by Schrödingerisation: absorbing boundaries and explicit polynomial-size circuits
Hoang Anh Nguyen, Ali Tura