Computation of Arctan N for -∞

  • Authors:

  • E. G. Kogbetliantz

  • Affiliations:

  • -

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1958

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rational (R) and polynomial (P) approximations to Arctan N are studied with the aim of computing this function, to any prescribed accuracy and without unduly increasing the number PC of stored constants, in a minimum number M of multiplications (and divisions for R approximations). The number Dg of first correct significant digits in principle is not bounded.