By Topic

Computation of Sin N, Cos N, and m√N Using an Electronic Computer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Rational Padé approximations to Sin N in the interval 0 ≤ N ≤ 41π/256 and to Cos N in 0 ≤ N ≤ 87π/256 allow the computation of both functions in 0 ≤ N ≤ π/2 with the first ten correct significant digits in four multiplications and divisions only. If the infinite range 0 ≤ N ≤ ∞ is considered, one more multiplication reduces it to the range 0 ≤ N ≤ π/2 so that the total number of operations is five. The method is flexible and gives any desired accuracy. Thus if eighteen first correct significant digits are required, they are obtained in seven operations for any N in (0, ∞). The same method applied to √N and 3√N yields a very accurate first guess which then is improved by Newton's method. For the radicals m√N with m > 4, Newton's method is too slow, and rational Padé approximations studied in this paper yield better subroutines.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:3 ,  Issue: 2 )