Error bounds on complex floating-point multiplication
From MaRDI portal
Publication:3433764
Recommendations
Cites work
Cited in
(15)- Floating-point arithmetic
- On the Lebesgue measure of the Feigenbaum Julia set
- Sharp error bounds for complex floating-point inversion
- Error bounds on complex floating-point multiplication with an FMA
- Error estimates for multiplication based on FFT over the complex numbers
- On relative errors of floating-point operations: optimal bounds and applications
- scientific article; zbMATH DE number 1206088 (Why is no real title available?)
- Backward error analysis of the shift-and-invert Arnoldi algorithm
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- Verification of positive definiteness
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- Error Bounds for Polynomial Evaluation and Complex Arithmetic
- Fast enclosure for all eigenvalues in generalized eigenvalue problems
- The relative accuracy of \(\mathtt{(x+y)*(x-y)}\)
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
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)