ACM Home Page
Please provide us with feedback. Feedback
Computer Generation of Optimized Subroutines
Full text PdfPdf (591 KB)
Source Journal of the ACM (JACM) archive
Volume 8 ,  Issue 1  (January 1961) table of contents
Pages: 104 - 116  
Year of Publication: 1961
ISSN:0004-5411
Author
Harry H. Denman  Wayne State University, Detroit, Michigan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

references   index terms   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321052.321059
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
2
 
3
For definitions and a general survey of the properties of Chebyshev polynomials, see NATIONAL BuReAu oF STanNDARDS, Tables of Chebyshev Polynomials, Applied Mathematics Series 9, Introduction.
 
4
W. GISBNER AND H. HOFR~ITER, Integraltafel, Zweiter Tell, p. 134, Eq. 55b. Springer, 1950.
 
5
S. Ross, Floating-point exponential subroutine IB FXP (description). IBM hi)plied Programming, June, 1958.
 
6
M. GOLDSTEIN AND R. M. THALER, Recurrence techniques for the calculations of Bcssel functions, MTAC 13 (1959), 102.
7
 
8
 
9
CARLSON AND GOLDSTIEIN, Rational approximations. Los Alamos Report 19061 AEC LA 1943.


Peer to Peer - Readers of this Article have also read: