Publication

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Fabio Nobile
2012
Report or working paper

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

https://infoscience.epfl.ch/record/263085?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

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

Graph Chatbot

Chat with Graph Search

An optimal preconditioned FFT-accelerated finite element solver for homogenization

Spectral analysis for transmission eigenvalue problems with and without the complementing conditions

Functional Tucker Approximation Using Chebyshev Interpolation

An optimal preconditioned FFT-accelerated finite element solver for homogenization

Spectral analysis for transmission eigenvalue problems with and without the complementing conditions

Functional Tucker Approximation Using Chebyshev Interpolation