Skip to Main content Skip to Navigation
Journal articles

A Monte Carlo computation of polynomial approximations on a hypercube

Sylvain Maire 1, 2 
1 TOSCA
INRIA Lorraine, CRISAM - Inria Sophia Antipolis - Méditerranée , UHP - Université Henri Poincaré - Nancy 1, Université Nancy 2, INPL - Institut National Polytechnique de Lorraine, CNRS - Centre National de la Recherche Scientifique : UMR7502
Abstract : We describe a Monte Carlo method which enables an iterative computation of the $L^2$ approximation of a function on any orthonormal basis. We use it for the approximation of smooth functions on an hypercube with the help of multidimensional orthogonal polynomial basis containing only few terms. The algorithm is both a tool for approximation and numerical integration.
Document type :
Journal articles
Complete list of metadata

https://hal-amu.archives-ouvertes.fr/hal-01479854
Contributor : William Domingues Vinhas Connect in order to contact the contributor
Submitted on : Tuesday, February 28, 2017 - 10:25:24 PM
Last modification on : Friday, February 4, 2022 - 3:24:10 AM

Links full text

Identifiers

Citation

Sylvain Maire. A Monte Carlo computation of polynomial approximations on a hypercube. Comptes Rendus. Mathématique, Académie des sciences (Paris), 2003, 336 (2), pp.185-190. ⟨10.1016/S1631-073X(03)00014-1⟩. ⟨hal-01479854⟩

Share

Metrics

Record views

144