超球多项式展开:快速计算超球系数的简单过程
The expansion in ultraspherical polynomials: a simple procedure for the fast computation of the ultraspherical coefficients
AI总结:
提出一种基于Abel型变换与快速傅里叶变换的算法,将函数f(cos u)的超球多项式展开系数计算复杂度降至O(N log₂ N)。
摘要:
我们提出了一种简单快速的算法,用于计算函数f(cos u)在超球(盖根鲍尔)多项式中的展开系数。我们证明这些系数与函数f(cos u)的Abel型变换的傅里叶系数一致。这使我们能够充分利用快速傅里叶变换的计算效率,仅需O(N log₂ N)次操作即可计算出前N个超球系数。
英文摘要:
We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an Abel-type transform of the function f(cos u). This allows us to fully exploit the computational efficiency of the Fast Fourier Transform, computing the first N ultraspherical coefficients in just O (N log_2 N) operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。