# Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

Abdellah Chkifa; Albert Cohen; Ronald DeVore; Christoph Schwab

- Volume: 47, Issue: 1, page 253-280
- ISSN: 0764-583X

## Access Full Article

top## Abstract

top## How to cite

topChkifa, Abdellah, et al. "Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 47.1 (2013): 253-280. <http://eudml.org/doc/273196>.

@article{Chkifa2013,

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 = H01(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.},

author = {Chkifa, Abdellah, Cohen, Albert, DeVore, Ronald, Schwab, Christoph},

journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},

keywords = {parametric and stochastic PDE’s; sparse polynomial approximation; high dimensional problems; adaptive algorithms; Taylor approximation; parametric and stochastic PDEs; high-dimensional problems; numerical experiments},

language = {eng},

number = {1},

pages = {253-280},

publisher = {EDP-Sciences},

title = {Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs},

url = {http://eudml.org/doc/273196},

volume = {47},

year = {2013},

}

TY - JOUR

AU - Chkifa, Abdellah

AU - Cohen, Albert

AU - DeVore, Ronald

AU - Schwab, Christoph

TI - Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs

JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

PY - 2013

PB - EDP-Sciences

VL - 47

IS - 1

SP - 253

EP - 280

AB - 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 = H01(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.

LA - eng

KW - parametric and stochastic PDE’s; sparse polynomial approximation; high dimensional problems; adaptive algorithms; Taylor approximation; parametric and stochastic PDEs; high-dimensional problems; numerical experiments

UR - http://eudml.org/doc/273196

ER -

## References

top- [1] I. Babuska, R. Tempone and G.E. Zouraris, Galerkin finite element approximations of stochastic elliptic partial differential equations. SIAM J. Numer. Anal. 42 (2004) 800−825. Zbl1080.65003MR2084236
- [2] I. Babuška, F. Nobile and R. Tempone, A stochastic collocation method for elliptic partial differential equations with random input data. SIAM J. Numer. Anal. 45 (2007) 1005−1034. Zbl1151.65008MR2318799
- [3] C. Bernardi and R. Verfürth, Adaptive finite element methods for elliptic equations with non-smooth coefficients. Numer. Math. 85 (2000) 579−608. Zbl0962.65096MR1771781
- [4] P. Binev, W. Dahmen, and R. DeVore, Adaptive finite element methods with convergence rates. Numer. Math. 97 (2004) 219−268. Zbl1063.65120MR2050077
- [5] A. Buffa, Y. Maday, A.T. Patera, C. Prudhomme and G. Turinici, A priori convergence of the greedy algorithm for the parameterized reduced basis. ESAIM : M2AN 3 (2012) 595–603. Zbl1272.65084MR2877366
- [6] A. Cohen, Numerical analysis of wavelet methods. Elsevier, Amsterdam (2003). Zbl1038.65151MR1990555
- [7] A. Cohen, W. Dahmen and R. DeVore, Adaptive wavelet methods for elliptic operator equations – Convergence rates. Math. Comput. 70 (2000) 27−75. Zbl0980.65130MR1803124
- [8] A. Cohen, W. Dahmen and R. DeVore, Adaptive wavelet methods for operator equations – Beyond the elliptic case. J. FoCM 2 (2002) 203−245. Zbl1025.65056MR1907380
- [9] A. Cohen, R. DeVore and C. Schwab, Convergence rates of best N-term Galerkin approximations for a class of elliptic sPDEs. Found. Comput. Math.10 (2010) 615–646. Zbl1206.60064MR2728424
- [10] A. Cohen, R. DeVore and C. Schwab, Analytic regularity and polynomial approximation of parametric and stochastic PDE’s. Anal. Appl.9 (2011) 11–47. Zbl1219.35379MR2763359
- [11] R. DeVore, Nonlinear approximation. Acta Numer.7 (1998) 51–150. Zbl0931.65007MR1689432
- [12] W. Dörfler, A convergent adaptive algorithm for Poisson’s equation. SIAM J. Numer. Anal.33 (1996) 1106–1124. Zbl0854.65090MR1393904
- [13] Ph. Frauenfelder, Ch. Schwab and R.A. Todor, Finite elements for elliptic problems with stochastic coefficients. Comput. Methods Appl. Mech. Eng.194 (2005) 205–228. Zbl1143.65392MR2105161
- [14] T. Gantumur, H. Harbrecht and R. Stevenson, An optimal adaptive wavelet method without coarsening of the iterands. Math. Comput.76 (2007) 615–629. Zbl1115.41023MR2291830
- [15] R. Ghanem and P. Spanos, Spectral techniques for stochastic finite elements. Arch. Comput. Methods Eng.4 (1997) 63–100. Zbl0722.73080MR1437889
- [16] P. Grisvard, Elliptic problems on non-smooth domains. Pitman (1983). Zbl0695.35060
- [17] V.H. Hoang and Ch. Schwab, Sparse tensor Galerkin discretizations for parametric and random parabolic PDEs I : Analytic regularity and gpc-approximation. Report 2010-11, Seminar for Applied Mathematics, ETH Zürich (in review). Zbl1285.35137
- [18] V.H. Hoang and Ch. Schwab, Analytic regularity and gpc approximation for parametric and random 2nd order hyperbolic PDEs. Report 2010-19, Seminar for Applied Mathematics, ETH Zürich (to appear in Anal. Appl. (2011)).
- [19] M. Kleiber and T.D. Hien, The stochastic finite element methods. John Wiley & Sons, Chichester (1992). Zbl0902.73004MR1198887
- [20] R. Milani, A. Quarteroni and G. Rozza, Reduced basis methods in linear elasticity with many parameters. Comput. Methods Appl. Mech. Eng.197 (2008) 4812–4829. Zbl1194.74445MR2467002
- [21] P. Morin, R.H. Nochetto and K.G. Siebert, Data oscillation and convergence of adaptive FEM. SIAM J. Numer. Anal.38 (2000) 466–488. Zbl0970.65113MR1770058
- [22] F. Nobile, R. Tempone and C.G. Webster, A sparse grid stochastic collocation method for elliptic partial differential equations with random input data. SIAM J. Numer. Anal.46 (2008) 2309–2345. Zbl1176.65137MR2421037
- [23] F. Nobile, R. Tempone and C.G. Webster, An anisotropic sparse grid stochastic collocation method for elliptic partial differential equations with random input data. SIAM J. Numer. Anal.46 (2008) 2411–2442. Zbl1176.65007MR2421041
- [24] Ch. Schwab and A.M. StuartSparse deterministic approximation of Bayesian inverse problems. Report 2011-16, Seminar for Applied Mathematics, ETH Zürich (to appear in Inverse Probl.). Zbl1236.62014MR2903278
- [25] Ch. Schwab and R.A. Todor, Karhúnen-Loève, Approximation of random fields by generalized fast multipole methods. J. Comput. Phys. 217 (2000) 100–122. Zbl1104.65008MR2250527
- [26] R. Stevenson, Optimality of a standard adaptive finite element method. Found. Comput. Math.7 (2007) 245–269. Zbl1136.65109MR2324418

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.