Publication

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Fabio Nobile
2012
Working Papers

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.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Chat with Graph Search

An FFT-based Numerical Method for Elasto-Plastic Contact

Automatic vs. human question answering over multimedia meeting recordings

The more you know, the less you learn: from knowledge transfer to one-shot learning of object categories