Choice of Basis for Chebyshev Approximation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Choice of Basis for Chebyshev Approximation

Full text

Pdf (277 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 8 , Issue 1 (March 1982) table of contents

Pages: 21 - 25

Year of Publication: 1982

ISSN:0098-3500

Author

Charles B. Dunham

Computer Science Department, University of Western Ontario, London, Ont., N6A 5B9 Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 33, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355984.355987 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	CHENEY, E.W Introductmn to Approx~matmn Theory. McGraw-Hill, New York, 1966
	2	CLENSHAW, C.W Chebyshev series for mathematical functions. In Mathematical Tables, vol. 5, National Physical Laboratory, Her Majesty's Statmnery Office, London, England, 1962.
	3	CoDY, W.J., FRASER, W., AND HART, J.F. Rational Chebyshev approximation using linear equations. Numer Math. 12 (1968), 242-251.
	4	DAVIS, P Interpolatmn and Approxlmatmn Blmsdell, New York, 1963.
	5	DUNHAM, C.B. Convergence of the Fraser-Hart algorithm for rational Chebyshev approximation. Math. Comput. 29 (1975}, 1078-1082.
	6	W. Fraser , J. F. Hart, On the computation of rational approximations to continuous functions, Communications of the ACM, v.5 n.7, p.401-403, July 1962 [doi>10.1145/368273.368578]
	7	W. Fraser , J. F. Hart, Remark on algorithm 162: Near-minimax polynomial approximations and partitioning of intervals, Communications of the ACM, v.7 n.8, p.486-489, Aug. 1964 [doi>10.1145/355586.364820]
	8	HART, J F., ET AL Computer Approx~matmns. Wiley, New York, 1968.
	9	RIVLIN, T J. The Chebyshev Polynomials. Wiley, New York, 1974.
	10	L. F. Shampine, Efficiency of a Procedure for Near-Minimax Approximation, Journal of the ACM (JACM), v.17 n.4, p.655-660, Oct. 1970 [doi>10.1145/321607.321614]
	11	WILKINSON, J.H. The solution of ill-conditioned linear equations In Mathematical Methods for Dtgttal Computers, Vol. 2, A. Ralston and H. Will (Eds.), Wiley, New York, 1967, pp. 65-93.