球面高斯-拉格朗日基函数的快速傅里叶变换
Fast Fourier Transforms for Spherical Gauss-Laguerre Basis Functions
AI总结:
本文提出了一种高效的球面高斯-拉格朗日基函数快速傅里叶变换算法,通过分离变量法和快速球面傅里叶变换,实现了复杂度为O(B⁴)的高效计算,显著优于传统方法。
摘要:
球面高斯-拉格朗日(SGL)基函数,即归一化形式为$ L_{n-l-1}^{(l + 1/2)} (r^2) r^{l} Y_{lm}(\vartheta,φ) $,$ |m| \leq l < n \in \mathbb{N} $,$ L_{n-l-1}^{(l + 1/2)} $为广义拉格朗日多项式,$ Y_{lm} $为球面谐波,构成$ L^2 $空间上的正交基,具有高斯权重$ \exp(-r^2) $。这些基函数在生物分子动态模拟中广泛应用。然而,目前尚无可靠的算法能快速计算函数相对于SGL基函数的傅里叶系数。本文提出此类广义FFT。我们从SGL采样定理出发,允许精确计算带限函数的SGL傅里叶展开。通过分离变量法和快速球面傅里叶变换,揭示了一类通用的快速SGL傅里叶变换。所有算法的渐近复杂度为$ \mathcal{O}(B^{4}) $,$ B $为相应的带宽,而实空间上的采样点数与$ B^3 $成正比。这明显优于传统方法的$ \mathcal{O}(B^{7}) $。同时,我们的方法使反变换的复杂度与正变换相同。我们通过数值实验展示了算法的实用性。值得注意的是,这是首次在非紧致域上实现广义FFT的性能。最后,我们讨论了真正的$ \mathcal{O}(B^{3} \log^{2} B) $快速SGL傅里叶变换和反变换的布局,并展望了未来的发展方向。
英文摘要:
Spherical Gauss-Laguerre (SGL) basis functions, i.e., normalized functions of the type $L_{n-l-1}^{(l + 1/2)} (r^2) r^{l} Y_{lm}(\vartheta,φ)$, $|m| \leq l < n \in \mathbb{N}$, $L_{n-l-1}^{(l + 1/2)}$ being a generalized Laguerre polynomial, $Y_{lm}$ a spherical harmonic, constitute an orthonormal basis of the space $L^{2}$ on $\mathbb{R}^{3}$ with Gaussian weight $\exp(-r^{2})$. These basis functions are used extensively, e.g., in biomolecular dynamic simulations. However, to the present, there is no reliable algorithm available to compute the Fourier coefficients of a function with respect to the SGL basis functions in a fast way. This paper presents such generalized FFTs. We start out from an SGL sampling theorem that permits an exact computation of the SGL Fourier expansion of bandlimited functions. By a separation-of-variables approach and the employment of a fast spherical Fourier transform, we then unveil a general class of fast SGL Fourier transforms. All of these algorithms have an asymptotic complexity of $\mathcal{O}(B^{4})$, $B$ being the respective bandlimit, while the number of sample points on $\mathbb{R}^{3}$ scales with $B^{3}$. This clearly improves the naive bound of $\mathcal{O}(B^{7})$. At the same time, our approach results in fast inverse transforms with the same asymptotic complexity as the forward transforms. We demonstrate the practical suitability of our algorithms in a numerical experiment. Notably, this is one of the first performances of generalized FFTs on a non-compact domain. We conclude with a discussion, including the layout of a true $\mathcal{O}(B^{3} \log^{2} B)$ fast SGL Fourier transform and inverse, and an outlook on future developments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。