Sparse spectral approximations for computing polynomial functionals
From MaRDI portal
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.
This page was built for publication: Sparse spectral approximations for computing polynomial functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234410)