Fast high-dimensional approximation with sparse occupancy trees

DOI10.1016/j.cam.2010.10.005zbMath1209.65018MaRDI QIDQ629454

Wolfgang Dahmen, Philipp Lamby, Peter Binev

Publication date: 9 March 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.10.005

zbMATH Keywords

numerical examples; scattered data approximation; high-dimensional approximation; non-linear approximation; non-parametric regression; multiresolution tree; piecewise linear schemes; simplex subdivisions

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

62J02: General nonlinear regression

41A63: Multidimensional problems

41A15: Spline approximation

Related Items

Interpretable Approximation of High-Dimensional Data, HARFE: hard-ridge random feature expansion, Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis, \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling, Sparse mixture models inspired by ANOVA decompositions, Approximation of functions over manifolds: a moving least-squares approach, Learning multivariate functions with low-dimensional structures using polynomial bases

Uses Software

• p4est
• ElemStatLearn

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Multivariate adaptive regression splines
• p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
• Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
• Multivariate Regression and Machine Learning with Sums of Separable Functions
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• An effective way to represent quadtrees