Implementing the complex arcsine and arccosine functions using exception handling

  • Authors:

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

  • Affiliations:

  • Univ. of Toronto, Toronto, Ont., Canada;Ryerson Polytechnic Univ., Toronto, Ont., Canada;Lawrence Berkeley National Lab, Berkeley, CA

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop efficient algorithms for reliable and accurate evaluatins of the complex arcsine and arccosine functions. A tight error bound is derived for each algorithm; the results are valid for all machine-representable points in the complex plane. The algorithms are presented in a pseudocode that has a convenient exception-handling facility. Corresponding Fortran 77 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 article, but the Fortran 77 programs are not (these programs are available from Fairgrieve). Tests of other widely available programs fail at many points in the complex plane, and otherwise are slower and produce much less accurate results.