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 (+, −, ×, /) 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 ≥ 4), and we show that this bound is asymptotically optimal (as p → ∞) 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 ≥ 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Baudin, M.: Error bounds of complex arithmetic. Available at http://forge.scilab.org/upload/compdiv/files/complexerrorbounds_v0.2.pdf (2011)
Baudin, M., Smith, R.L.: A robust complex division in Scilab. Available at http://arxiv.org/abs/1210.4539 (2012)
Brent, R., Percival, C., Zimmermann, P.: Error bounds on complex floating-point multiplication. Math. Comput. 76(259), 1469–1481 (2007)
Champagne, W.P.: On finding roots of polynomials by hook or by crook. Master’s thesis, University of Texas (1964)
Higham, N. J.: Accuracy and Stability of Numerical Algorithms, second edn. SIAM, Philadelphia, PA, USA (2002)
IEEE Computer Society: IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754–2008 (2008). http://ieeexplore.ieee.org/servlet/opac?punumber=4610933
Knuth, D.E.: The Art of Computer Programming, Volume 2, Seminumerical Algorithms, third edn. Addison-Wesley, Reading, MA, USA (1998)
Priest, D.M.: Efficient scaling for complex division. ACM Trans. Math. Softw. 30(4), 389–401 (2004)
Rump, S.M., Ogita, T., Oishi, S.: Accurate floating-point summation, Part I: Faithful rounding. SIAM J. Sci. Comput. 31(1), 189–224 (2008)
Smith, R.L.: Algorithm 116: Complex division. Commun. ACM 5(8), 435 (1962)
Stewart, G.W.: A note on complex division. ACM Trans. Math. Softw. 11(3), 238–241 (1985)
Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Oxford University Press (1965)
Ziv, A.: Sharp ULP rounding error bound for the hypotenuse function. Math. Comput. 68(227), 1143–1148 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jeannerod, CP., Louvet, N., Muller, JM. et al. Sharp error bounds for complex floating-point inversion. Numer Algor 73, 735–760 (2016). https://doi.org/10.1007/s11075-016-0115-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-016-0115-x