5 citations · 7 across the 3 of their papers we have counts for
Showing math.NAShow all
2 papers · 1 filter
math.NA2008★ 5 cited
Optimizing polynomials for floating-point implementation
Florent De Dinechin, Christoph Quirin Lauter
The floating-point implementation of a function on an interval often reduces to polynomial approximation, the polynomial being typically provided by Remez algorithm. However, the f…
math.NA2008★ 2 cited
Certifying floating-point implementations using Gappa
Florent De Dinechin, Christoph Quirin Lauter, Guillaume Melquiond
High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, o…