Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data (Q2359680): Difference between revisions

It is known that as dimension increases, smooth multivariate functions are increasingly well represented by their best k-term approximation in certain orthogonal expansions. Therefore, in this paper, an infinite dimensional approach has been introduced to discuss the problem of approximating a smooth function from finitely many pointwise samples using \(\ell^{1}\)-minimization techniques. This approach provides interpolatory approximation in the absence of noise and does not require a priori bounds on the expansion tail for implementation. Also, it does not depend on the approximated function, if the function has sufficient regularity. A worst-case error analysis has been discussed. Moreover, it has been shown that weighted \(\ell^{1}\)-minimization with Jacobi polynomials leads to an optimal method for approximating smooth, one-dimensional functions from scattered data.