Skip to Main content Skip to Navigation
Conference papers

On the componentwise accuracy of complex floating-point division with an FMA

Claude-Pierre Jeannerod 1, 2 Nicolas Louvet 1, 2 Jean-Michel Muller 1, 2
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper deals with the accuracy of complex division in radix-two floating-point arithmetic. Assuming that a fused multiply-add (FMA) instruction is available and that no underflow/overflow occurs, we study how to ensure high relative accuracy in the componentwise sense. Since this essentially reduces to evaluating accurately three expressions of the form ac+bd, an obvious approach would be to perform three calls to Kahan's compensated algorithm for 2 by 2 determinants. However, in the context of complex division, two of those expressions are such that ac and bd have the same sign, suggesting that cheaper schemes should be used here (since cancellation cannot occur). We first give a detailed accuracy analysis of such schemes for the sum of two nonnegative products, providing not only sharp bounds on both their absolute and relative errors, but also sufficient conditions for the output of one of them to coincide with the output of Kahan's algorithm. By combining Kahan's algorithm with this particular scheme, we then deduce two new division algorithms. Our first algorithm is a straight-line program whose componentwise relative error is always at most 5u+13u^2 with u the unit roundoff; we also provide examples of inputs for which the error of this algorithm approaches 5u, thus showing that our upper bound is essentially the best possible. When tests are allowed we show with a second algorithm that the bound above can be further reduced to (9/2) u+9u^2, and that this improved bound is reasonably sharp.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Jean-Michel Muller <>
Submitted on : Thursday, February 7, 2013 - 8:55:21 AM
Last modification on : Wednesday, November 20, 2019 - 2:29:57 AM
Long-term archiving on: : Wednesday, May 8, 2013 - 3:52:05 AM


Files produced by the author(s)


  • HAL Id : ensl-00734339, version 2



Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller. On the componentwise accuracy of complex floating-point division with an FMA. 21st IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.83--90. ⟨ensl-00734339v2⟩



Record views


Files downloads