Jump to content

Split-step method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 38.115.166.174 (talk) at 08:27, 13 June 2009 (Description of the method). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In numerical analysis, the split-step (Fourier) method is a pseudo-spectral numerical method used to solve nonlinear partial differential equations like the nonlinear Schrödinger equation. The name arises for two reasons. First, the method relies on computing the solution in small steps, and treating the linear and the nonlinear steps separately (see below). Second, it is necessary to Fourier transform back and forth because the linear step is made in the frequency domain while the nonlinear step is made in the time domain.

An example of usage of this method is in the field of light pulse propagation in optical fibers, where the interaction of linear and nonlinear mechanisms makes it difficult to find general analytical solutions. However, the split-step method provides a numerical solution to the problem.

Description of the method

Consider, for example, the nonlinear Schrödinger equation[1]

where describes the pulse envelope in time at the spatial position . The equation can be split into a linear part,

and a nonlinear part,

Both the linear and the nonlinear parts have analytical solutions, but the nonlinear Schrödinger equation containing both parts does not have a general analytical solution.

However, if only a 'small' step is taken along , then the two parts can be treated separately with only a 'small' numerical error. One can therefore first take a small nonlinear step,

using the analytical solution.

The dispersion step has an analytical solution in the frequency domain, so it is first necessary to Fourier transform using

,

where is the center frequency of the pulse. It can be shown that using the above definition of the Fourier transform, the analytical solution to the linear step is

By taking the inverse Fourier transform of one obtains ; the pulse has thus been propagated a small step . By repeating the above times, the pulse can be propagated over a length of .

The Fourier transforms of this algorithm can be computed relatively fast using the fast Fourier transform (FFT). The split-step Fourier method can therefore be much faster than typical finite difference methods[2].

References

  1. ^ Agrawal, Govind P. (2001). Nonlinear Fiber Optics (3rd ed.). San Diego, CA, USA: Academic Press. ISBN 0-12-045143-3.
  2. ^ T. R. Taha and M. J. Ablowitz (1984). "Analytical and numerical aspects of certain nonlinear evolution equations. II. Numerical, nonlinear Schrödinger equation". J. Comput. Phys. 55 (2): 203–230. doi:10.1016/0021-9991(84)90003-2. {{cite journal}}: Cite has empty unknown parameter: |month= (help)

External references