A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions

In this work we develop a dynamically adaptive sparse grids (SG) method for quasi-optimal interpolation of multidimensional analytic functions defined over a product of one dimensional bounded domains. The goal of such approach is to construct an interpolant in space that corresponds to the "best $M$-terms" based on sharp a priori estimate of polynomial coefficients. In the past, SG methods have been successful in achieving this, with a traditional construction that relies on the solution to a Knapsack problem: only the most profitable hierarchical surpluses are added to the SG. However, this approach requires additional sharp estimates related to the size of the analytic region and the norm of the interpolation operator, i.e., the Lebesgue constant. Instead, we present an iterative SG procedure that adaptively refines an estimate of the region and accounts for the effects of the Lebesgue constant. Our approach does not require any a priori knowledge of the analyticity or operator norm, is easily generalized to both affine and non-affine analytic functions, and can be applied to sparse grids build from one dimensional rules with arbitrary growth of the number of nodes. In several numerical examples, we utilize our dynamically adaptive SG to interpolate quantities of interest related to the solutions of parametrized elliptic and hyperbolic PDEs, and compare the performance of our quasi-optimal interpolant to several alternative SG schemes.

[1]  Clayton G. Webster,et al.  A GRADIENT-BASED SAMPLING APPROACH FOR DIMENSION REDUCTION OF PARTIAL DIFFERENTIAL EQUATIONS WITH STOCHASTIC COEFFICIENTS , 2015 .

[2]  H. Bungartz,et al.  Sparse grids , 2004, Acta Numerica.

[3]  Houman Owhadi,et al.  A non-adapted sparse approximation of PDEs with stochastic inputs , 2010, J. Comput. Phys..

[4]  L. Einkemmer.  Quasi-Monte Carlo methods , 2010 .

[5]  Guannan Zhang,et al.  Stochastic finite element methods for partial differential equations with random input data* , 2014, Acta Numerica.

[6]  Wolfgang Dahmen,et al.  Convergence Rates for Greedy Algorithms in Reduced Basis Methods , 2010, SIAM J. Math. Anal..

[7]  Albert Cohen,et al.  Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs , 2011 .

[8]  K. Ritter,et al.  Simple Cubature Formulas with High Polynomial Exactness , 1999 .

[9]  Guannan Zhang,et al.  Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients , 2015, Numerische Mathematik.

[10]  C. W. Clenshaw,et al.  A method for numerical integration on an automatic computer , 1960 .

[11]  Leopold Fejér,et al.  On the infinite sequences arising in the theories of harmonic analysis, of interpolation, and of mechanical quadratures , 1933 .

[12]  Fabio Nobile,et al.  Computers and Mathematics with Applications Convergence of Quasi-optimal Stochastic Galerkin Methods for a Class of Pdes with Random Coefficients , 2022 .

[13]  Moulay Abdellah Chkifa.  On the Lebesgue constant of Leja sequences for the complex unit disk and of their real projection , 2013, J. Approx. Theory.

[14]  Stefano De Marchi,et al.  On Leja sequences: some results and applications , 2004, Appl. Math. Comput..

[15]  Albert Cohen,et al.  Convergence Rates of Best N-term Galerkin Approximations for a Class of Elliptic sPDEs , 2010, Found. Comput. Math..

[16]  J. Glinsky,et al.  The general. , 1982, Nursing.

[17]  Fabio Nobile,et al.  Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: application to random elliptic PDEs , 2016, Numerische Mathematik.

[18]  Charles E. Clark,et al.  Monte Carlo , 2006 .

[19]  R. DeVore,et al.  Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs , 2010 .

[20]  Sophia Blau,et al.  Analysis Of The Finite Element Method , 2016 .

[21]  Albert Cohen,et al.  High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs , 2013, Foundations of Computational Mathematics.

[22]  Ronald DeVore,et al.  Greedy Algorithms for Reduced Bases in Banach Spaces , 2012, Constructive Approximation.

[23]  Gianluca Iaccarino,et al.  A least-squares approximation of partial differential equations with high-dimensional random inputs , 2009, J. Comput. Phys..

[24]  Fabio Nobile,et al.  A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data , 2008, SIAM J. Numer. Anal..

[25]  Seddik M. Djouadi,et al.  Optimal order reduction for the the two-dimensional burgers’ equation , 2007, 2007 46th IEEE Conference on Decision and Control.

[26]  Abubakr Gafar Abdalla,et al.  Probability Theory , 2017, Encyclopedia of GIS.

[27]  Fabio Nobile,et al.  An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data , 2008, SIAM J. Numer. Anal..

[28]  Christoph Schwab,et al.  Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients , 2007 .

[29]  N. Nguyen,et al.  A general multipurpose interpolation procedure: the magic points , 2008 .

[30]  Guannan Zhang,et al.  Explicit cost bounds of stochastic Galerkin approximations for parameterized PDEs with random coefficients , 2015, Comput. Math. Appl..