Interpolation of sparse high-dimensional data
From MaRDI portal
Publication:2048831
DOI10.1007/s11075-020-01040-2zbMath1471.62407OpenAlexW3098479569MaRDI QIDQ2048831
Kirk Cameron, Yili Hong, Thomas C. H. Lux, Tyler H. Chang, Layne T. Watson
Publication date: 24 August 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-01040-2
Estimation in multivariate analysis (62H12) General nonlinear regression (62J02) Numerical interpolation (65D05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: Application to random elliptic PDEs
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Multivariate adaptive regression splines
- A practical guide to splines
- Box splines
- Optimal Latin-hypercube designs for computer experiments
- Multilayer feedforward networks are universal approximators
- High dimensional polynomial interpolation on sparse grids
- Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces
- Algorithm 905
- Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
- Monotone Piecewise Cubic Interpolation
- Two algorithms for constructing a Delaunay triangulation
- Shepard's Method of "Metric Interpolation" to Bivariate and Multivariate Interpolation
- Sparse grids
- Learning representations by back-propagating errors
- Nearest neighbor pattern classification
- On the distribution of Fekete points
- A Stochastic Approximation Method
This page was built for publication: Interpolation of sparse high-dimensional data
