Implementing complex elementary functions using exception handling

  • Authors:
  • T. E. Hull;Thomas F. Fairgrieve;Ping-Tak Peter Tang

  • Affiliations:
  • Univ. of Toronto, Toronto, Ont., Canada;Univ. of Toronto, Toronto, Ont., Canada;Argonne National Lab, Argonne, IL

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Algorithms are developed for reliable and accurate evaluations of the complex elementary functions required in FORTRAN 77 and FORTRAN 9, namely, cabs, csqrt, cexp, clog, csin, and ccos. The algorithms are presented in a pseudocode that has a convenient exception-handling facility. A tight error bound is derived for each algorithm. Corresponding FORTRAN programs for an IEEE environment have also been developed to illustrate the practicality of the algorithms, and these programs have been tested very carefully to help confirm the correctness of the algorithms and their error bounds. The results of these tests are included in the paper, but the FORTRAN programs are not.