Skip to main navigation Skip to search Skip to main content

Evaluating Straight-Line Programs over Balls

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

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.

Original languageEnglish
Title of host publicationProceedings - 2016 IEEE 23rd Symposium on Computer Arithmetic, ARITH 2016
EditorsJavier Hormigo, Nathalie Revol, Paolo Montuschi, Stuart Oberman, Michael Schulte
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages142-149
Number of pages8
ISBN (Electronic)9781509016150
DOIs
Publication statusPublished - 7 Sept 2016
Event23rd IEEE Symposium on Computer Arithmetic, ARITH 2016 - Santa Clara, United States
Duration: 10 Jul 201613 Jul 2016

Publication series

NameProceedings - Symposium on Computer Arithmetic
Volume2016-September

Conference

Conference23rd IEEE Symposium on Computer Arithmetic, ARITH 2016
Country/TerritoryUnited States
CitySanta Clara
Period10/07/1613/07/16

Keywords

  • ball arithmetic
  • polynomial evaluation
  • software implementation

Fingerprint

Dive into the research topics of 'Evaluating Straight-Line Programs over Balls'. Together they form a unique fingerprint.

Cite this