快速非线性傅里叶变换
Fast Numerical Nonlinear Fourier Transforms
AI总结:
本文提出两种快速非线性傅里叶变换方法,用于非线性薛定谔方程,分别实现O(D²)和O(D log²D)的运算效率,扩展至其他演化方程。
摘要:
非线性傅里叶变换,也称为正向散射变换,将周期信号分解为非线性相互作用的波。与传统傅里叶变换不同,这些波不再必须是正弦波。物理相关的波形常用于分析。变换细节取决于分析所依据的波形,这又通过隐含假设信号由特定演化方程支配来指定。例如,由Korteweg-de Vries方程生成的水波可表示为cnoidal波。由非线性薛定谔方程(NSE)支配的光纤断续波是另一个例子。非线性经典问题如谱分析和滤波的非线性类比出现在许多应用中,如Yousefi和Kschischang提出的光纤信息传输。非线性傅里叶变换非常适合解决这些问题——至少从理论角度看。虽然有数值算法可用于计算变换,但至今尚未出现与快速傅里叶变换同样有效的快速非线性傅里叶变换。本文的目标是解决这个问题。本文提出两种快速计算非线性傅里叶变换的方法,针对NSE。第一种方法实现O(D²)的浮点运算次数,其中D是样本点数。第二种方法仅适用于NSE为发散情况,但实现O(D log²D)的运算次数。结果扩展至其他演化方程也进行了讨论。
英文摘要:
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be sinusoidal. Physically relevant waveforms are often available for the analysis instead. The details of the transform depend on the waveforms underlying the analysis, which in turn are specified through the implicit assumption that the signal is governed by a certain evolution equation. For example, water waves generated by the Korteweg-de Vries equation can be expressed in terms of cnoidal waves. Light waves in optical fiber governed by the nonlinear Schrödinger equation (NSE) are another example. Nonlinear analogs of classic problems such as spectral analysis and filtering arise in many applications, with information transmission in optical fiber, as proposed by Yousefi and Kschischang, being a very recent one. The nonlinear Fourier transform is eminently suited to address them -- at least from a theoretical point of view. Although numerical algorithms are available for computing the transform, a "fast" nonlinear Fourier transform that is similarly effective as the fast Fourier transform is for computing the common Fourier transform has not been available so far. The goal of this paper is to address this problem. Two fast numerical methods for computing the nonlinear Fourier transform with respect to the NSE are presented. The first method achieves a runtime of $O(D^2)$ floating point operations, where $D$ is the number of sample points. The second method applies only to the case where the NSE is defocusing, but it achieves an $O(D\log^2D)$ runtime. Extensions of the results to other evolution equations are discussed as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。