Jean-Michel Muller

Further analysis of Kahan’s algorithm for the accurate computation of 2×2 determinants

We provide a detailed analysis of Kahans algorithm for the accurate computation of the determinant of a

Newton-Raphson algorithms for floating-point division using an FMA

2 \times 2

Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors

matrix. This algorithm requires the availability of a fused multiply-add instruction. Assuming radix-

Computing correctly rounded integer powers in floating-point arithmetic

\beta

On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic

, precision-

On the Error of Computing ab + cd using Cornea, Harrison and Tang's Method

p

Sharp error bounds for complex floating-point inversion

floating-point arithmetic with

Computing Integer Powers in Floating-Point Arithmetic

\beta

Correctly rounded multiplication by arbitrary precision constants

even,

Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic

p \geq 2