Functional Tucker Approximation Using Chebyshev Interpolation
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.
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 th ...
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix-valued function is computationally expensive. ...
In this project, we study and compare two methods to solve stochastic ordinary differential equations. The first is the Monte Carlo method and the second uses Polynomial Chaos. In the first part, we will solve a stochastic ordinary differential equation by ...
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 th ...
Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this problem; the currently available methods, however, are hard to deploy for large-scale inter ...
The paper introduces a cubic-phase-function based method to estimate interference phase in digital holographic interferometry. The proposed method relies on piecewise polynomial approximation of phase by dividing an arbitrary row/column of the complex reco ...
Classical digital signal processing (DSP) lore tells us the tale of a continuous-time primeval signal, of its brutal sampling, and of the magic sinc interpolation that, under the aegis of bandlimitedness, brings the original signal back to (continuous) lif ...
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomial or piecewise sinusoidal signals, and call the number of degrees of freedom ...
In this thesis we address the numerical approximation of the incompressible Navier-Stokes equations evolving in a moving domain with the spectral element method and high order time integrators. First, we present the spectral element method and the basic to ...
