Convergence Problems in Maehly's Second Method: Part II

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Convergence Problems in Maehly's Second Method: Part II

Full text

Pdf (374 KB)

Source

Journal of the ACM (JACM) archive
Volume 13 , Issue 1 (January 1966) table of contents

Pages: 108 - 113

Year of Publication: 1966

ISSN:0004-5411

Author

Charles B. Dunham

Computer Science Department, University of Western Ontario, London, Ontario, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 21, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

Tools and Actions:	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/321312.321320 What is a DOI?

ABSTRACT

Maehly's second method is a general algorithm for finding the best Chebyshev approximation to a continuous function on a finite interval. This paper examines the convergence properties of Maehly's second method, a modification, and the more commonly used algorithm of Remez, using both analytical and numerical results.

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	Charles B. Dunham, Convergence Problems in Maehly's Second Method, Journal of the ACM (JACM), v.12 n.2, p.181-186, April 1965 [doi>10.1145/321264.321268]
	2	Hans J. Maehly, Methods for Fitting Rational Approximations, Parts II and III, Journal of the ACM (JACM), v.10 n.3, p.257-277, July 1963 [doi>10.1145/321172.321173]