Loading...
working paper
Sparse spectral approximations for computing polynomial functionals
2012
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 satised in many cases, including the Fourier and Hermite basis.
Use this identifier to reference this record
Loading...
Name
Sparse_spectral_approximations.pdf
Access type
openaccess
Size
703.68 KB
Format
Adobe PDF
Checksum (MD5)
2fd6dfc3b85c549087e32d4f2c286319