A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
From MaRDI portal
Publication:2007287
Abstract: 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 -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.
Recommendations
- Multivariate quadrature on adaptive sparse grids
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- scientific article; zbMATH DE number 66109
- B-spline quasi-interpolation on sparse grids
- Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3438337 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- A GRADIENT-BASED SAMPLING APPROACH FOR DIMENSION REDUCTION OF PARTIAL DIFFERENTIAL EQUATIONS WITH STOCHASTIC COEFFICIENTS
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A general multipurpose interpolation procedure: The magic points
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A method for numerical integration on an automatic computer
- A non-adapted sparse approximation of PDEs with stochastic inputs
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
- Convergence rates for greedy algorithms in reduced basis methods
- Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Greedy algorithms for reduced bases in Banach spaces
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- On Leja sequences: some results and applications
- On the Lebesgue constant of Leja sequences for the complex unit disk and of their real projection
- Simple cubature formulas with high polynomial exactness
- Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
- Sparse grids
- Stochastic finite element methods for partial differential equations with random input data
Cited in
(9)- Algorithm 1040: the Sparse Grids Matlab Kit -- a Matlab implementation of sparse grids for high-dimensional function approximation and uncertainty quantification
- Numerical analysis of a second order ensemble algorithm for numerical approximation of stochastic Stokes-Darcy equations
- An efficient and accurate penalty-projection eddy viscosity algorithm for stochastic magnetohydrodynamic flow problems
- An efficient second-order accurate and continuous interpolation for block-adaptive grids
- An evolve-filter-relax stabilized reduced order stochastic collocation method for the time-dependent Navier-Stokes equations
- Dynamic Sparsing in Stiff Extrapolation Methods
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- A method for dimensionally adaptive sparse trigonometric interpolation of periodic functions
- The gap between theory and practice in function approximation with deep neural networks
This page was built for publication: A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007287)
