Efficiently transforming from values of a function on a sparse grid to basis coefficients
From MaRDI portal
Publication:2091301
DOI10.1007/978-3-030-81362-8_10zbMath1497.65063arXiv2110.00856OpenAlexW3204586775MaRDI QIDQ2091301
Tucker jun. Carrington, Robert Wodraszka
Publication date: 1 November 2022
Full work available at URL: https://arxiv.org/abs/2110.00856
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Global sensitivity analysis through polynomial chaos expansion of a basin-scale geochemical compaction model
- Fast matrix-vector multiplication in the sparse-grid Galerkin method
- Spatially adaptive sparse grids for high-dimensional data-driven problems
- Fouriertransform on sparse grids with hierarchical bases
- Inverses of \(2\times 2\) block matrices
- Comparing nested sequences of Leja and PseudoGauss points to interpolate in 1D and solve the Schrödinger equation in 9D
- Fundamental splines on sparse grids and their application to gradient-based optimization
- High dimensional polynomial interpolation on sparse grids
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Algorithm 847
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
- Sparse grids
- High-Order Collocation Methods for Differential Equations with Random Inputs
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- Lagrange interpolation at Laguerre zeros in some weighted uniform spaces
