Fast sparse grid operations using the unidirectional principle: a generalized and unified framework

DOI10.1007/978-3-030-81362-8_4zbMath1498.65059OpenAlexW4245430214MaRDI QIDQ2091292

David Holzmüller, Dirk Pflüger

Publication date: 1 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81362-8_4

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Numerical approximation of high-dimensional functions; sparse grids (65D40)

Uses Software

• Fastsg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Option pricing with a direct adaptive sparse grid approach
• Fast matrix-vector multiplication in the sparse-grid Galerkin method
• Spatially adaptive sparse grids for high-dimensional data-driven problems
• Fundamental splines on sparse grids and their application to gradient-based optimization
• Polynomial chaos expansions for dependent random variables
• Heterogeneous distributed big data clustering on sparse grids
• A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm
• A New Subspace-Based Algorithm for Efficient Spatially Adaptive Sparse Grid Regression, Classification and Multi-evaluation
• Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
• Selected Recent Applications of Sparse Grids
• The Solution of Multidimensional Real Helmholtz Equations on Sparse Grids
• Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
• Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids
• Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout
• Sparse grids
• Data mining with sparse grids

This page was built for publication: Fast sparse grid operations using the unidirectional principle: a generalized and unified framework