On multivariate discrete least squares

Published: 01 Jan 2016, Last Modified: 14 May 2025J. Approx. Theory 2016EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: For a positive integer n∈NnN we introduce the index set Nn:={1,2,…,n}Nn:={1,2,,n}. Let X:={xi:i∈Nn}X:={xi:iNn} be a distinct set of vectors in RdRd, Y:={yi:i∈Nn}Y:={yi:iNn} a prescribed data set of real numbers in RR and F:={fj:j∈Nm},m, a given set of real valued continuous functions defined on some neighborhood OO of RdRd containing XX. The discrete least squares problem determines a (generally unique) function f=∑j∈Nmcj⋆fj∈spanFf=jNmcjfjspanF which minimizes the square of the ℓ2−2norm ∑i∈Nn(∑j∈Nmcjfj(xi)−yi)2iNn(jNmcjfj(xi)yi)2 over all vectors (cj:j∈Nm)∈Rm(cj:jNm)Rm. The value of ff at some s∈OsO may be viewed as the optimally predicted value (in the ℓ2−2sense) of all functions in spanFspanF from the given data X={xi:i∈Nn}X={xi:iNn} and Y={yi:i∈Nn}Y={yi:iNn}.We ask “What happens if the components of XX and ss are nearly the same”. For example, when all these vectors are near the origin in RdRd. From a practical point of view this problem comes up in image analysis when we wish to obtain a new pixel value from nearby available pixel values as was done in [2], for a specified set of functions FF.This problem was satisfactorily solved in the univariate case in Section 6 of Lee and Micchelli (2013). Here, we treat the significantly more difficult multivariate case using an approach recently provided in Yeon Ju Lee, Charles A. Micchelli and Jungho Yoon (2015).
Loading