Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
TL;DR: In this paper, an adaptive numerical algorithm for constructing a sequence of sparse polynomials that is proved to converge toward the solution with the optimal benchmark rate is presented, where the convergence rate in terms of N does not depend on the number of parameters in V, which may be arbitrarily large or countably infinite.
read more
Abstract: The numerical approximation of parametric partial differential equations is a computational challenge, in particular when the number of involved parameter is large. This paper considers a model class of second order, linear, parametric, elliptic PDEs on a bounded domain D with diffusion coefficients depending on the parameters in an affine manner. For such models, it was shown in (9, 10) that under very weak assumptions on the diffusion coefficients, the entire family of solutions to such equations can be simultaneously approximated in the Hilbert space V = H 1 0 (D) by multivariate sparse polynomials in the parameter vector y with a controlled number N of terms. The convergence rate in terms of N does not depend on the number of parameters in V , which may be arbitrarily large or countably infinite, thereby breaking the curse of dimensionality. However, these approximation results do not describe the concrete construction of these polynomial expansions, and should therefore rather be viewed as benchmark for the convergence analysis of numerical methods. The present paper presents an adaptive numerical algorithm for constructing a sequence of sparse polynomials that is proved to converge toward the solution with the optimal benchmark rate. Numerical experiments are presented in large parameter dimension, which confirm the effectiveness of the adaptive approach. Mathematics Subject Classification. 65N35, 65L10, 35J25.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Low-rank methods for high-dimensional approximation and model order reduction
TL;DR: The problem of best approximation in subsets of low-rank tensors is analyzed and its connection with the problem of optimal model reduction in low-dimensional reduced spaces is discussed.
497
Approximation of high-dimensional parametric PDEs *
Albert Cohen,Ronald A. DeVore +1 more
TL;DR: Results reveal that, at least on a theoretical level, the solution map can be well approximated by discretizations of moderate complexity, thereby showing how the curse of dimensionality is broken.
335
High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs
TL;DR: An interpolation technique in which the sample set is incremented as the polynomial dimension increases, leading therefore to a minimal amount of PDE solving, which is based on the standard principle of tensorisation of a one-dimensional interpolation scheme and sparsification.
Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
TL;DR: In this article, an analytic extension of the solution map on a tensor product of ellipses in the complex domain is proposed to estimate the Legendre coefficients of u. The analytic extension is based on the holomorphic version of the implicit function theorem in Banach spaces and can be applied to a large variety of parametric PDEs.
257
Model Reduction and Neural Networks for Parametric PDEs
Kaushik Bhattacharya,Bamdad Hosseini,Nikola B. Kovachki,Andrew M. Stuart +3 more
- 07 Jul 2021
TL;DR: A neural network approximation which, in principle, is defined on infinite-dimensional spaces and, in practice, is robust to the dimension of finite-dimensional approximations of these spaces required for computation is developed.
References
•Book
The Finite Element Method for Elliptic Problems
Philippe G. Ciarlet,J. T. Oden +1 more
- 01 Jan 1978
TL;DR: The finite element method has been applied to a variety of nonlinear problems, e.g., Elliptic boundary value problems as discussed by the authors, plate problems, and second-order problems.
8.9K
•Book
Finite Element Method for Elliptic Problems
Philippe G. Ciarlet
- 01 Apr 2002
TL;DR: In this article, Ciarlet presents a self-contained book on finite element methods for analysis and functional analysis, particularly Hilbert spaces, Sobolev spaces, and differential calculus in normed vector spaces.
8.7K
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
TL;DR: A rigorous convergence analysis is provided and exponential convergence of the “probability error” with respect to the number of Gauss points in each direction in the probability space is demonstrated, under some regularity assumptions on the random input data.
A convergent adaptive algorithm for Poisson's equation
TL;DR: In this paper, a converging adaptive algorithm for linear elements applied to Poisson's equation in two space dimensions is presented, and it is proved that the error, measured in the energy norm, decreases at a constant rate in each step until a prescribed error bound is reached.
1.4K
A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
TL;DR: This work demonstrates algebraic convergence with respect to the total number of collocation points and quantifies the effect of the dimension of the problem (number of input random variables) in the final estimates, indicating for which problems the sparse grid stochastic collocation method is more efficient than Monte Carlo.