Sparse spectral approximations for computing polynomial functionals
Numerical Analysis
2012-07-17 v1
Abstract
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.
Cite
@article{arxiv.1207.3728,
title = {Sparse spectral approximations for computing polynomial functionals},
author = {Erwan Faou and Fabio Nobile and Christophe Vuillot},
journal= {arXiv preprint arXiv:1207.3728},
year = {2012}
}