ACM Home Page
Please provide us with feedback. Feedback
Degree reduction for trigonometric functions
Full text PdfPdf (167 KB)
Source ACM SIGNUM Newsletter archive
Volume 18 ,  Issue 2  (April 1983) table of contents
Pages: 18 - 19  
Year of Publication: 1983
ISSN:0163-5778
Authors
Mary H. Payne  Digital Equipment Corporation, Hudson, MA
Robert N. Hanek  Digital Equipment Corporation, Hudson, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 2
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1057605.1057606
What is a DOI?

ABSTRACT

This report is a companion to Reference 1 on radian reduction. As in Reference 1, the motivation arises from a desire to eliminate messages like "argument too large" in trigonometric function routines. The presence of very large arguments in the VAX H format, on the Crayl, and on an IEEE machine with extended registers, make this a real problem. As for the radian reduction algorithm, the degree algorithm will reduce any argument, however large, so long as it is representable; its speed is nearly independent of the size of the argument to be reduced; and full accuracy is maintained in the neighborhoods of the zeros of the desired function. We believe that the approach is new and represents a significant improvement over procedures currently in use. A variant of the procedure is used in Version 3 of the VAX Math Library.


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

Collaborative Colleagues:
Mary H. Payne: colleagues
Robert N. Hanek: colleagues