# Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs

- Handle URI:
- http://hdl.handle.net/10754/550822
- Title:
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Authors:
- Abstract:
- 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 in the univariate case, the least-squares method is quasi-optimal in expectation in [A. Cohen, M A. Davenport and D. Leviatan. Found. Comput. Math. 13 (2013) 819–834] and in probability in [G. Migliorati, F. Nobile, E. von Schwerin, R. Tempone, Found. Comput. Math. 14 (2014) 419–456], under suitable conditions that relate the number of samples with respect to the dimension of the polynomial space. Here “quasi-optimal” means that the accuracy of the least-squares approximation is comparable with that of the best approximation in the given polynomial space. In this paper, we discuss the quasi-optimality of the polynomial least-squares method in arbitrary dimension. Our analysis applies to any arbitrary multivariate polynomial space (including tensor product, total degree or hyperbolic crosses), under the minimal requirement that its associated index set is downward closed. The optimality criterion only involves the relation between the number of samples and the dimension of the polynomial space, independently of the anisotropic shape and of the number of variables. We extend our results to the approximation of Hilbert space-valued functions in order to apply them to the approximation of parametric and stochastic elliptic PDEs. As a particular case, we discuss “inclusion type” elliptic PDE models, and derive an exponential convergence estimate for the least-squares method. Numerical results confirm our estimate, yet pointing out a gap between the condition necessary to achieve optimality in the theory, and the condition that in practice yields the optimal convergence rate.
- KAUST Department:
- Citation:
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs 2015, 49 (3):815 ESAIM: Mathematical Modelling and Numerical Analysis
- Publisher:
- Journal:
- Issue Date:
- 8-Apr-2015
- DOI:
- 10.1051/m2an/2014050
- Type:
- Article
- ISSN:
- 0764-583X; 1290-3841
- Additional Links:
- http://www.esaim-m2an.org/10.1051/m2an/2014050

- Appears in Collections:
- Articles; Applied Mathematics and Computational Science Program

# Full metadata record

DC Field | Value | Language |
---|---|---|

dc.contributor.author | Chkifa, Abdellah | en |

dc.contributor.author | Cohen, Albert | en |

dc.contributor.author | Migliorati, Giovanni | en |

dc.contributor.author | Nobile, Fabio | en |

dc.contributor.author | Tempone, Raul | en |

dc.date.accessioned | 2015-04-28T12:20:48Z | en |

dc.date.available | 2015-04-28T12:20:48Z | en |

dc.date.issued | 2015-04-08 | en |

dc.identifier.citation | Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs 2015, 49 (3):815 ESAIM: Mathematical Modelling and Numerical Analysis | en |

dc.identifier.issn | 0764-583X | en |

dc.identifier.issn | 1290-3841 | en |

dc.identifier.doi | 10.1051/m2an/2014050 | en |

dc.identifier.uri | http://hdl.handle.net/10754/550822 | en |

dc.description.abstract | 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 in the univariate case, the least-squares method is quasi-optimal in expectation in [A. Cohen, M A. Davenport and D. Leviatan. Found. Comput. Math. 13 (2013) 819–834] and in probability in [G. Migliorati, F. Nobile, E. von Schwerin, R. Tempone, Found. Comput. Math. 14 (2014) 419–456], under suitable conditions that relate the number of samples with respect to the dimension of the polynomial space. Here “quasi-optimal” means that the accuracy of the least-squares approximation is comparable with that of the best approximation in the given polynomial space. In this paper, we discuss the quasi-optimality of the polynomial least-squares method in arbitrary dimension. Our analysis applies to any arbitrary multivariate polynomial space (including tensor product, total degree or hyperbolic crosses), under the minimal requirement that its associated index set is downward closed. The optimality criterion only involves the relation between the number of samples and the dimension of the polynomial space, independently of the anisotropic shape and of the number of variables. We extend our results to the approximation of Hilbert space-valued functions in order to apply them to the approximation of parametric and stochastic elliptic PDEs. As a particular case, we discuss “inclusion type” elliptic PDE models, and derive an exponential convergence estimate for the least-squares method. Numerical results confirm our estimate, yet pointing out a gap between the condition necessary to achieve optimality in the theory, and the condition that in practice yields the optimal convergence rate. | en |

dc.publisher | EDP Sciences | en |

dc.relation.url | http://www.esaim-m2an.org/10.1051/m2an/2014050 | en |

dc.rights | Archived with thanks to ESAIM: Mathematical Modelling and Numerical Analysis. © EDP Sciences, SMAI 2015 | en |

dc.subject | Approximation theory | en |

dc.subject | polynomial approximation | en |

dc.subject | least squares | en |

dc.subject | parametric and stochastic PDEs | en |

dc.subject | high-dimensional approximation | en |

dc.title | en | |

dc.type | Article | en |

dc.contributor.department | Applied Mathematics and Computational Science Program | en |

dc.contributor.department | Center for Uncertainty Quantification in Computational Science and Engineering (SRI-UQ) | en |

dc.identifier.journal | ESAIM: Mathematical Modelling and Numerical Analysis | en |

dc.eprint.version | Publisher's Version/PDF | en |

dc.contributor.institution | Institut Universitaire de France, UPMC Univ Paris 06, UMR 7598, Laboratoire Jacques-Louis Lions, 75005 Paris, France | en |

dc.contributor.institution | MATHICSE-CSQI, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland | en |

kaust.author | Tempone, Raul | en |

All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.