Towards Machine-Efficient Rational L ∞ -Approximations of Mathematical Functions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Towards Machine-Efficient Rational L ∞ -Approximations of Mathematical Functions

Résumé

Software implementations of mathematical functions often use approximations that can be either polynomial or rational in nature. While polynomials are the preferred approximation in most cases, rational approximations are nevertheless an interesting alternative when dealing with functions that have a pronounced "nonpolynomial behavior" (such as poles close to the approximation domain, asymptotes or finite limits at ±∞). The major challenge is that of computing good rational approximations with machine number coefficients (e.g. floatingpoint or fixed-point) with respect to the supremum norm, a key step in most procedures for evaluating a mathematical function. This is made more complicated by the fact that even when dealing with real-valued coefficients, optimal supremum norm solutions are sometimes difficult to obtain. Here, we introduce flexible and fast algorithms for computing such rational approximations with both real and machine number coefficients. Their effectiveness is explored on several examples.
Fichier principal
Vignette du fichier
rminimax_hal.pdf (1.13 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04093020 , version 1 (09-05-2023)
hal-04093020 , version 2 (21-07-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04093020 , version 2

Citer

Nicolas Brisebarre, Silviu-Ioan Filip. Towards Machine-Efficient Rational L ∞ -Approximations of Mathematical Functions. 30th IEEE International Symposium on Computer Arithmetic ARITH 2023, Sep 2023, Portland, United States. ⟨hal-04093020v2⟩
218 Consultations
83 Téléchargements

Partager

Gmail Facebook X LinkedIn More