Sparse interpolation in terms of multivariate Chebyshev polynomials (Q2098236): Difference between revisions

Sparse interpolation determines an element from a linear space of functions from evaluations at particular points. This article deals with the spare interpolation problem for linear combinations of multivariate Chebyshev polynomials of first and second kind [\textit{M. E. Hoffman} and \textit{W. D. Withers}, Trans. Am. Math. Soc. 308, No. 1, 91--104 (1988; Zbl 0681.33020)]. The primarily symbolic algorithms bear similarities to a multivariate version of Prony's method and, as an intermediate step, use Hankel or mixed Hankel-Toepliz matrices for the recovery of the support of a linear form. In order to increase efficiency, it is key to exploit the underlying symmetry of the problem that comes from the interpretation of Chebyshev polynomials in terms of root systems and their Weyl group. This symmetry is the main theme in this rather long but comprehensive, well-written, and self-contained article.