Evaluating Straight-Line Programs over Balls

Joris van der Hoeven 1 Grégoire Lecerf 2
2 Équipe Max
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : Interval arithmetic achieves numerical reliability for a wide range of applications, at the price of a performance penalty. For applications to homotopy continuation, one key ingredient is the efficient and reliable evaluation of complex polynomials represented by straight-line programs. This is best achieved using ball arithmetic, a variant of interval arithmetic. In this article, we describe strategies for reducing the performance penalty of basic operations on balls. We also show how to bound the effect of rounding errors at the global level of evaluating a straight-line program. This allows us to introduce a new and faster "transient" variant of ball arithmetic.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01225979
Contributor : Joris van der Hoeven <>
Submitted on : Saturday, November 7, 2015 - 5:14:11 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on : Monday, February 8, 2016 - 11:12:49 AM

File

dagball-hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01225979, version 1

Citation

Joris van der Hoeven, Grégoire Lecerf. Evaluating Straight-Line Programs over Balls. 2015. ⟨hal-01225979⟩

Share

Metrics

Record views

367

Files downloads

208