How to Compute the Area of a Triangle: a Formal Revisit - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

How to Compute the Area of a Triangle: a Formal Revisit

(1, 2)
1
2

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, an improvement of its error bound and new investigations in case of underflow.
Fichier principal
Vignette du fichier
article.pdf (229.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00790071 , version 1 (19-02-2013)

Identifiers

Cite

Sylvie Boldo. How to Compute the Area of a Triangle: a Formal Revisit. 21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.91-98, ⟨10.1109/ARITH.2013.29⟩. ⟨hal-00790071⟩
328 View
762 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More