Numerical Chebyshev Approximation by Interpolating Rationals

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1972Publisher:JSTORJournal:Mathematics of Computation, volume 26, page 199 (issn: 0025-5718,

Copyright policy )

Authors: Williams, Jack;

doi: 10.2307/2004729 , 10.1090/s0025-5718-1972-0373230-6

Numerical Chebyshev Approximation by Interpolating Rationals

- Summary
- Subjects
- Metrics

Abstract

The paper is concerned with the Chebyshev approximation of decay-type functions f ( x ) f(x) by interpolating rationals. The interpolating points are chosen to be the zeros of f ( x ) f(x) . Existence, uniqueness and characterization of best approximations are first shown. An exchange algorithm is then described for computing the best approximation.

Keywords

Best approximation, Chebyshev systems, Numerical smoothing, curve fitting

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average