Skip to main navigation Skip to search Skip to main content

Multiple-precision evaluation of the Airy Ai function with reduced cancellation

  • INRIA
  • Ecole Normale Supérieure de Lyon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The series expansion at the origin of the Airy function Ai(x) is alternating and hence problematic to evaluate for x > 0 due to cancellation. Based on a method recently proposed by Gawronski, Müller, and Rein hard, we exhibit two functions F and G, both with nonnegative Taylor expansions at the origin, such that Ai(x) = G(x)/F(x). The sums are now well-conditioned, but the Taylor coefficients of G turn out to obey an ill-conditioned three-term recurrence. We use the classical Miller algorithm to overcome this issue. We bound all errors and our implementation allows an arbitrary and certified accuracy, that can be used, e.g., for providing correct rounding in arbitrary precision.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE 21st Symposium on Computer Arithmetic, ARITH 2013
Pages175-182
Number of pages8
DOIs
Publication statusPublished - 13 Aug 2013
Externally publishedYes
Event21st Symposium on Computer Arithmetic, ARITH 2013 - Austin, TX, United States
Duration: 7 Apr 201310 Apr 2013

Publication series

NameProceedings - Symposium on Computer Arithmetic

Conference

Conference21st Symposium on Computer Arithmetic, ARITH 2013
Country/TerritoryUnited States
CityAustin, TX
Period7/04/1310/04/13

Keywords

  • Miller method
  • Special functions
  • algorithm
  • arbitrary precision
  • asymptotics
  • correct rounding
  • error bounds
  • numerical evaluation

Fingerprint

Dive into the research topics of 'Multiple-precision evaluation of the Airy Ai function with reduced cancellation'. Together they form a unique fingerprint.

Cite this