计算多项式泛函的稀疏谱逼近
Sparse spectral approximations for computing polynomial functionals
AI总结:
提出一种快速方法用于评估非线性多项式泛函的谱逼近,并证明在函数足够光滑且谱本征函数满足一般假设(如傅里叶和埃尔米特基)下算法收敛。
摘要:
我们给出了一种新的快速方法,用于评估非线性多项式泛函的谱逼近。我们证明,在谱本征函数的一般假设下(该假设在许多情况下成立,包括傅里叶和埃尔米特基),如果所考虑的函数足够光滑,则新算法收敛。
英文摘要:
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions that turns out to be satisfied in many cases, including the Fourier and Hermite basis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。