Back to Search
Start Over
Interpolation of sparse high-dimensional data
- Source :
- Numerical Algorithms. 88:281-313
- Publication Year :
- 2020
- Publisher :
- Springer Science and Business Media LLC, 2020.
-
Abstract
- Increases in the quantity of available data have allowed all fields of science to generate more accurate models of multivariate phenomena. Regression and interpolation become challenging when the dimension of data is large, especially while maintaining tractable computational complexity. Regression is a popular approach to solving approximation problems with high dimension; however, there are often advantages to interpolation. This paper presents a novel and insightful error bound for (piecewise) linear interpolation in arbitrary dimension and contrasts the performance of some interpolation techniques with popular regression techniques. Empirical results demonstrate the viability of interpolation for moderately high-dimensional approximation problems, and encourage broader application of interpolants to multivariate approximation in science.
- Subjects :
- Clustering high-dimensional data
Computational complexity theory
Applied Mathematics
Numerical analysis
MathematicsofComputing_NUMERICALANALYSIS
010103 numerical & computational mathematics
Linear interpolation
01 natural sciences
010101 applied mathematics
Dimension (vector space)
Theory of computation
Piecewise
0101 mathematics
Algorithm
Mathematics
Interpolation
Subjects
Details
- ISSN :
- 15729265 and 10171398
- Volume :
- 88
- Database :
- OpenAIRE
- Journal :
- Numerical Algorithms
- Accession number :
- edsair.doi...........67b87b8b8dd361077c6575d0cca28535