Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations
Publications associées (50)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We address adaptive multivariate polynomial approximation by means of the discrete least-squares method with random evaluations, to approximate in the L2 probability sense a smooth function depending on a random variable distributed according to a given pr ...
This work considers the infinite-time discounted optimal control problem for continuous time input-affine polynomial dynamical systems subject to polynomial state and box input constraints. We propose a sequence of sum-of-squares (SOS) approximations of th ...
We study the accuracy of the discrete least-squares approximation on a finite-dimensional space of a real-valued target function from noisy pointwise evaluations at independent random points distributed according to a given sampling probability measure. Th ...
We analyze the stability and accuracy of discrete least squares on multivariate polynomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated s ...
We analyze the accuracy of the discrete least-squares approximation of a function u in multivariate polynomial spaces PΛ:=span{y↦yν∣ν∈Λ} with Λ⊂N0d over the domain Γ:=[−1,1]d, based on the sa ...
We analyze the stability and accuracy of discrete least squares on multivariate poly- nomial spaces to approximate a given function depending on a multivariate random variable uniformly distributed on a hypercube. The polynomial approximation is calculated ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...
The interface control domain decomposition (ICDD) method of Discacciati, Gervasio, and Quarteroni [SIAM J. Control Optim., 51 (2013), pp. 3434-3458, doi:10.1137/120890764; J. Coupled Syst. Multiscale Dyn., 1 (2013), pp. 372-392, doi:10.1166/jcsmd.2013.1026 ...
We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of \mathds1{p≤0} to the image plane, where \mathds1 denotes the indicator function and p is some r ...
Let F 2 C[x; y; z] be a constant-degree polynomial, and let A; B; C subset of C be finite sets of size n. We show that F vanishes on at most O(n(11/6))points of the Cartesian product A X B X C, unless F has a special group-related form. This improves a the ...