Error bounds on complex floating-point multiplication
From MaRDI portal
Publication:3433764
DOI10.1090/S0025-5718-07-01931-XzbMATH Open1118.65031DBLPjournals/moc/BrentPZ07OpenAlexW1969155620WikidataQ56938993 ScholiaQ56938993MaRDI QIDQ3433764FDOQ3433764
Authors: Richard P. Brent, Colin Percival, Paul Zimmermann
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
Recommendations
Cites Work
Cited In (14)
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Floating-point arithmetic
- On relative errors of floating-point operations: Optimal bounds and applications
- Error Bounds for Polynomial Evaluation and Complex Arithmetic
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- Verification of positive definiteness
- Title not available (Why is that?)
- Sharp error bounds for complex floating-point inversion
- The relative accuracy of \(\mathtt{(x+y)*(x-y)}\)
- Error bounds on complex floating-point multiplication with an FMA
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- On the Lebesgue measure of the Feigenbaum Julia set
Uses Software
This page was built for publication: Error bounds on complex floating-point multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3433764)