Related papers: Parallel Implementations of the Split-Step Fourier…
In this paper, we propose a parallel-in-time algorithm for approximately solving parabolic equations. In particular, we apply the $k$-step backward differentiation formula, and then develop an iterative solver by using the waveform…
In this paper, a scalable iterative projection-type algorithm for solving non-stationary systems of linear inequalities is considered. A non-stationary system is understood as a large-scale system of inequalities in which coefficients and…
Remarkable mathematical properties of the integrable nonlinear Schr\"odinger equation (NLSE) can offer advanced solutions for the mitigation of nonlinear signal distortions in optical fibre links. Fundamental optical soliton, continuous and…
In this work we introduce a new family of 14-steps linear multistep methods for the integration of the Schr\"odinger equation. The new methods are phase fitted but they are designed in order to improve the frequency tolerance. This is…
It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…
To extend prevailing scaling limits when solving time-dependent partial differential equations, the parallel full approximation scheme in space and time (PFASST) has been shown to be a promising parallel-in-time integrator. Similar to a…
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in this area fall into three groups: cache-aware tiled looping…
We perform a systematic study of the accuracy of split-step Fourier transform methods for the time dependent Gross-Pitaevskii equation using symbolic calculation. Provided the most recent approximation for the wave function is always used…
Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary…
The time-dependent one-dimensional nonlinear Schr\"odinger equation (NLSE) is solved numerically by a hybrid pseudospectral-variational quantum algorithm that connects a pseudospectral step for the Hamiltonian term with a variational step…
The nonlinear Schr\"odinger and the Schr\"odinger-Newton equations model many phenomena in various fields. Here, we perform an extensive numerical comparison between splitting methods (often employed to numerically solve these equations)…
In this paper we present two strategies to enable "parallelization across the method" for spectral deferred corrections (SDC). Using standard low-order time-stepping methods in an iterative fashion, SDC can be seen as preconditioned Picard…
The prevalent need for very high-speed digital signals processing in wireless communications has driven the communications system to high-performance levels. The objective of this paper is to propose a novel structure for efficient…
This research work focuses on the design of a high-resolution fast Fourier transform (FFT) /inverse fast Fourier transform (IFFT) processors for constraints analysis purpose. Amongst the major setbacks associated with such high resolution,…
Discrete cosine transform (DCT) and other Fourier-related transforms have broad applications in scientific computing. However, off-the-shelf high-performance multi-dimensional DCT (MD DCT) libraries are not readily available in parallel…
In this research, numerical analysis of nonlinear pulse propagation is carried out. This is done mainly by solving the nonlinear Schrodinger equation using the split step algorithm. In a nonlinear media, dispersive effects exist…
We propose a multi-dimensional (M-D) sparse Fourier transform inspired by the idea of the Fourier projection-slice theorem, called FPS-SFT. FPS-SFT extracts samples along lines (1-dimensional slices from an M-D data cube), which are…
This paper presents a comprehensive exploration of Fast Fourier Transform (FFT) and linear convolution implementations, integrating both conventional methods and novel approaches leveraging the Bit Slicing Multiplier (BSM) technique. The…
This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transformation (NFT). The theoretical underpinnings of this generalization of the conventional…
The Dantzig selector is a widely used and effective method for variable selection in ultra-high-dimensional data. Feature splitting is an efficient processing technique that involves dividing these ultra-high-dimensional variable datasets…