Thumbnail
Access Restriction
Subscribed

Author Chu, Wen-Hwa ♦ Saathoff, Donald R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The technique of obtaining arctangents by inverse interpolation [1] is a relatively long process not suitable for a subroutine. The Taylor series expansion for arguments less than unity converges rather slowly for those near unity. The method of small increments of the argument [2] is again inconvenient for a subroutine. A more rapid series expansion in terms of Chebyshev polynomial [3] is given in terms of a new argument, which is less than 0.1989. This method requires the storage of π, √2 - 1 and seven coefficients and is perhaps widely used. However, for multiple precision not only the coefficients have to be evaluated to the precision desired, but more must be used. Therefore the following alternative method may prove to be convenient and efficient.
Description Affiliation: Southwest Research Institute, San Antonio, TX (Chu, Wen-Hwa; Saathoff, Donald R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 6
Issue Number 9
Page Count 2
Starting Page 516
Ending Page 517


Open content in new tab

   Open content in new tab
Source: ACM Digital Library