Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants

DOI10.1090/S0025-5718-2013-02679-8zbMath1277.65026OpenAlexW1982696069MaRDI QIDQ5326508

Nicolas Louvet, Claude-Pierre Jeannerod, Jean-Michel Muller

Publication date: 6 August 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02679-8

zbMATH Keywords

roundoff error analysisfloating-point arithmetic\(2\times 2\) determinantKahan's algorithm

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of determinants (65F40)

Related Items (5)

First steps towards more numerical reproducibility ⋮ Floating-point arithmetic ⋮ Error bounds on complex floating-point multiplication with an FMA ⋮ 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

Uses Software

• mctoolbox
• LBNL

Cites Work

• Unnamed Item
• Error bounds on complex floating-point multiplication
• High-precision division and square root
• Accuracy and Stability of Numerical Algorithms
• Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Formally certified floating-point filters for homogeneous geometric predicates
• Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit

This page was built for publication: Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants