An adaptive high-order piecewise polynomial based sparse grid collocation method with applications

Abstract

This paper constructs adaptive sparse grid collocation method onto arbitrary order piecewise polynomial space. The sparse grid method is a popular technique for high dimensional problems, and the associated collocation method has been well studied in the literature. The contribution of this work is the introduction of a systematic framework for collocation onto high-order piecewise polynomial space that is allowed to be discontinuous. We consider both Lagrange and Hermite interpolation methods on nested collocation points. Our construction includes a wide range of function space, including those used in sparse grid continuous finite element method. Error estimates are provided, and the numerical results in function interpolation, integration and some benchmark problems in uncertainty quantification are used to compare different collocation schemes.

References in corpus (3)

• Sparse Grid Discontinuous Galerkin Methods for High-Dimensional Elliptic Equations
• Stochastic collocation approach with adaptive mesh refinement for parametric uncertainty analysis
• An adaptive multiresolution discontinuous Galerkin method with artificial viscosity for scalar hyperbolic conservation laws in multidimensions

Cited by in corpus (5)

• An adaptive sparse grid local discontinuous Galerkin method for Hamilton-Jacobi equations in high dimensions
• An adaptive multiresolution discontinuous Galerkin method with artificial viscosity for scalar hyperbolic conservation laws in multidimensions
• An adaptive multiresolution ultra-weak discontinuous Galerkin method for nonlinear Schrodinger equations
• An adaptive multiresolution interior penalty discontinuous Galerkin method for wave equations in second order form
• A sparse grid discrete ordinate discontinuous Galerkin method for the radiative transfer equation