Spatially adaptive sparse grids for high-dimensional data-driven problems

DOI10.1016/j.jco.2010.04.001zbMath1200.65100MaRDI QIDQ708314

Hans-Joachim Bungartz, Dirk Pflüger, Benjamin Peherstorfer

Publication date: 11 October 2010

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2010.04.001

zbMATH Keywords

classification; regularization; numerical examples; adaptive refinement; high-dimensional approximation; edge-detection; non-smooth functions; spatially adaptive sparse grids

Mathematics Subject Classification ID

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

Related Items

A highly parallel Black–Scholes solver based on adaptive sparse grids, On the construction of sparse tensor product spaces, Option pricing with a direct adaptive sparse grid approach, An adaptive sparse grid semi-Lagrangian scheme for first order Hamilton-Jacobi Bellman equations, An efficient approximate residual evaluation in the adaptive tensor product wavelet method

Uses Software

• UCI-ml

Cites Work

• The combination technique and some generalisations
• Fitting multidimensional data using gradient penalties and the sparse grid combination technique
• On additive Schwarz preconditioners for sparse grid discretizations
• Multidimensional smoothing using hyperbolic interpolatory wavelets
• Regularization networks and support vector machines
• A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• The Relationship between Variable Selection and Data Agumentation and a Method for Prediction
• Sparse grids
• Data mining with sparse grids
• An incremental prototype set building technique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item