# Sharp error bounds for complex floating-point inversion

1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We study the accuracy of the classic algorithm for inverting a complex number given by its real and imaginary parts as floating-point numbers. Our analyses are done in binary floating-point arithmetic, with an unbounded exponent range and in precision $p$; we also assume that the basic arithmetic operations ($+$, $-$, $\times$, $/$) are rounded to nearest, so that the roundoff unit is $u = 2^{-p}$. We bound the largest relative error in the computed inverse either in the componentwise or in the normwise sense. We prove the componentwise relative error bound $3u$ for the complex inversion algorithm (assuming $p \ge 4$), and we show that this bound is asymptotically optimal (as $p\to \infty$) when $p$ is even, and sharp when using one of the basic IEEE 754 binary formats with an odd precision ($p=53,113$). This componentwise bound obviously leads to the same bound $3u$ for the normwise relative error. However, we prove that the smaller bound $2.707131u$ holds (assuming $p \ge 24$) for the normwise relative error, and we illustrate the sharpness of this bound for the basic IEEE 754 binary formats ($p=24, 53, 113$) using numerical examples.
Keywords :
Type de document :
Article dans une revue
Numerical Algorithms, Springer Verlag, 2016, 73 (3), pp.735-760. 〈10.1007/s11075-016-0115-x〉
Domaine :

Littérature citée [12 références]

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01195625
Contributeur : Jean-Michel Muller <>
Soumis le : vendredi 19 février 2016 - 10:47:07
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : vendredi 20 mai 2016 - 10:39:38

### Fichier

VersionAccepteeNumericalAlgori...
Fichiers produits par l'(les) auteur(s)

### Citation

Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller, Antoine Plet. Sharp error bounds for complex floating-point inversion. Numerical Algorithms, Springer Verlag, 2016, 73 (3), pp.735-760. 〈10.1007/s11075-016-0115-x〉. 〈ensl-01195625v2〉

### Métriques

Consultations de la notice

## 440

Téléchargements de fichiers