Chebyshev multivariate polynomial approximation and point reduction procedure
Nadezda Sukhorukova, Julien Ugon, David Yost

TL;DR
This paper extends Chebyshev approximation theory to multivariate functions, providing geometric interpretations, a fast necessary condition verification algorithm, and a generalized alternating sequence for optimality conditions.
Contribution
It introduces a geometric interpretation of multivariate optimality conditions and develops a fast algorithm for verifying necessary conditions, along with a generalized alternating sequence.
Findings
The algorithm significantly speeds up necessary condition verification.
The geometric interpretation applies to various basis functions.
A generalized alternating sequence for multivariate polynomials is proposed.
Abstract
The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the notion of alternating sequence to the case of multivariate functions is not trivial. The contribution of this paper is two-fold. First of all, we give a geometrical interpretation of the necessary and sufficient optimality condition for multivariate approximation. These optimality conditions are not limited to the case polynomial approximation, where the basis functions are monomials. Second, we develop an algorithm for fast necessary optimality conditions verifications (polynomial case only). Although, this procedure only verifies the necessity, it is much faster than the necessary and sufficient conditions verification. This procedure is based on a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
