Chebyshev Multivariate Polynomial Approximation and Point Reduction Procedure.
Saved in:
| Title: | Chebyshev Multivariate Polynomial Approximation and Point Reduction Procedure. |
|---|---|
| Authors: | Sukhorukova, Nadezda, Ugon, Julien, Yost, David |
| Source: | Constructive Approximation; Jun2021, Vol. 53 Issue 3, p529-544, 16p |
| Subject Terms: | POLYNOMIAL approximation, CHEBYSHEV polynomials, CHEBYSHEV approximation, POLYNOMIALS, NONSMOOTH optimization |
| Abstract: | We apply the methods of nonsmooth and convex analysis to extend the study of Chebyshev (uniform) approximation for univariate polynomial functions to the case of general multivariate functions (not just polynomials). First of all, we give new necessary and sufficient optimality conditions for multivariate approximation, and a geometrical interpretation of them which reduces to the classical alternating sequence condition in the univariate case. Then, we present a procedure for verification of necessary and sufficient optimality conditions that is based on our generalization of the notion of alternating sequence to the case of multivariate polynomials. Finally, we develop an algorithm for fast verification of necessary optimality conditions in the multivariate polynomial case. [ABSTRACT FROM AUTHOR] |
| Copyright of Constructive Approximation is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!