Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2]

Full text

Pdf (142 KB)

Source

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

Pages: 95 - 97

Year of Publication: 1976

ISSN:0098-3500

Author

Joseph C. Simpson

Academic Computer Service, Miami University, Oxford, OH

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

appendices and supplements references index terms peer to peer

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/355666.355674 What is a DOI?

APPENDICES and SUPPLEMENTS

APPROX/EXCH (501.gz) (6 KB)

best polynomial approximation to a discrete one-dimensional data set in the Chebyshev (minimax) sense
Gams: K2

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.