Publications associées à Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

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.

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We analyze the accuracy of the discrete least-squares approximation of a function

u

in multivariate polynomial spaces

P_\Lambda:=span\{y\mapsto y^\nu \,: \, \nu\in \Lambda\}

with

\Lambda\subset N_0^d

over the domain

\Gamma:=[-1,1]^d

, based on the s ...

2017

Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations

Graph Chatbot

Chattez avec Graph Search

MATHICSE Technical Report : Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization

MATHICSE Technical Report: Interpolatory rational model order reduction of parametric problems lacking uniform inf-sup stability

Stable high-order randomized cubature formulae in arbitrary dimension

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Sampling at unknown locations, with an application in surface retrieval

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

Multilevel weighted least squares polynomial approximation

MATHICSE Technical Report : Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Multilevel weighted least squares polynomial approximation

Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Sampling at unknown locations, with an application in surface retrieval

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

MATHICSE Technical Report : Multilevel weighted least squares polynomial approximation

MATHICSE Technical Report: Interpolatory rational model order reduction of parametric problems lacking uniform inf-sup stability

Stable high-order randomized cubature formulae in arbitrary dimension

Polynomial Escape-Time From Saddle Points In Distributed Non-Convex Optimization