Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs

Information Technology Institute, Vietnam National University, 144 Xuan Thuy, Cau Giay, Hanoi, Vietnam

^* Corresponding author: dinhzung@gmail.com

Received: 27 March 2020
Accepted: 11 April 2021

Abstract

By combining a certain approximation property in the spatial domain, and weighted 𝓁₂-summability of the Hermite polynomial expansion coefficients in the parametric domain obtained in Bachmayr et al. [ESAIM: M2AN 51 (2017) 341–363] and Bachmayr et al. [SIAM J. Numer. Anal. 55 (2017) 2151–2186], we investigate linear non-adaptive methods of fully discrete polynomial interpolation approximation as well as fully discrete weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs. We construct such methods and prove convergence rates of the approximations by them. The linear non-adaptive methods of fully discrete polynomial interpolation approximation are sparse-grid collocation methods which are certain sums taken over finite nested Smolyak-type indices sets of mixed tensor products of dyadic scale successive differences of spatial approximations of particular solvers, and of successive differences of their parametric Lagrange interpolating polynomials. The Smolyak-type sparse interpolation grids in the parametric domain are constructed from the roots of Hermite polynomials or their improved modifications. Moreover, they generate in a natural way fully discrete weighted quadrature formulas for integration of the solution to parametric and stochastic elliptic PDEs and its linear functionals, and the error of the corresponding integration can be estimated via the error in the Bochner space L₁ (ℝ^∞, V, γ) norm of the generating methods where γ is the Gaussian probability measure on ℝ^∞ and V is the energy space. We also briefly consider similar problems for parametric and stochastic elliptic PDEs with affine inputs, and problems of non-fully discrete polynomial interpolation approximation and integration. In particular, the convergence rates of non-fully discrete polynomial interpolation approximation and integration obtained in this paper significantly improve the known ones.