Journal ArticleOPEN ACCESS

Chebyshev approximation by exponential-polynomial sums

Journal of Computational and Applied Mathematics (1979) 5(1) 53-57
DOI: 10.1016/0771-050X(79)90027-5
7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is shown that best Chebyshev approximations by exponential-polynomial sums are characterized by (a variable number of) alternations of their error curve and are unique. Computation of best approximations via the Remez algorithm and Barrodale approach is considered. © 1979.

Cite

CITATION STYLE

APA

Dunham, C. B. (1979). Chebyshev approximation by exponential-polynomial sums. Journal of Computational and Applied Mathematics, 5(1), 53–57. https://doi.org/10.1016/0771-050X(79)90027-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free