Further analysis of Kahan's algorithm for the accurate computation of 2 2 determinants
From MaRDI portal
(Redirected from Publication:5326508)
Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
Recommendations
Cites work
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Error bounds on complex floating-point multiplication
- Formally certified floating-point filters for homogeneous geometric predicates
- High-precision division and square root
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven
- Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit
Cited in
(10)- Error bounds on complex floating-point multiplication with an FMA
- First steps towards more numerical reproducibility
- Error-controlled values of determinant obtained by approximate calculation
- On the error of computing ab+cd using Cornea, Harrison and Tang's method
- A radix-independent error analysis of the Cornea-Harrison-Tang method
- Floating-point arithmetic
- Arithmetical enhancements of the Kogbetliantz method for the SVD of order two
- Fast and accurate intersections on a sphere
- Random knotting in very long off-lattice self-avoiding polygons
- Accurate determinants of some classes of matrices
This page was built for publication: Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326508)