Sparse spectral approximations for computing polynomial functionals

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.


Published in:
.....
Year:
2012
Keywords:
Laboratories:




 Record created 2012-08-22, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)