Error bounds on complex floating-point multiplication
From MaRDI portal
Publication:3433764
DOI10.1090/S0025-5718-07-01931-XzbMath1118.65031OpenAlexW1969155620WikidataQ56938993 ScholiaQ56938993MaRDI QIDQ3433764
Colin Percival, Paul Zimmermann, Richard P. Brent
Publication date: 2 May 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-07-01931-x
Related Items
Backward error analysis of the shift-and-invert Arnoldi algorithm, Fast enclosure for all eigenvalues in generalized eigenvalue problems, Sharp error bounds for complex floating-point inversion, Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants, On the Lebesgue measure of the Feigenbaum Julia set, Floating-point arithmetic, Error bounds on complex floating-point multiplication with an FMA, On relative errors of floating-point operations: Optimal bounds and applications, Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic, Verification of positive definiteness, The relative accuracy of \(\mathtt{(x+y)*(x-y)}\)
Uses Software
Cites Work
