How to Compute the Area of a Triangle: a Formal Revisit with a Tighter Error Bound - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2013

How to Compute the Area of a Triangle: a Formal Revisit with a Tighter Error Bound

Abstract

Mathematical values are usually computed using well-known mathematical formulas without thinking about their accuracy, which may turn awful with particular instances. This is the case for the computation of the area of a triangle. When the triangle is needle-like, the common formula has a very poor accuracy. Kahan proposed in 1986 an algorithm he claimed correct within a few ulps. Goldberg took over this algorithm in 1991 and gave a precise error bound. This article presents a formal proof of this algorithm, investigations in case of underflow and a new improvement of its error bound.
Fichier principal
Vignette du fichier
article.pdf (273.04 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00862653 , version 1 (17-09-2013)

Identifiers

  • HAL Id : hal-00862653 , version 1

Cite

Sylvie Boldo. How to Compute the Area of a Triangle: a Formal Revisit with a Tighter Error Bound. 2013. ⟨hal-00862653⟩
178 View
251 Download

Share

Gmail Facebook X LinkedIn More