<< accsum_order Support accsum_shuffle >>

Accsum >> Accsum > Support > accsum_priestx

accsum_priestx

A difficult example for SCS by Priest.

Calling Sequence

x = accsum_priestx ( )

Parameters

x :

a 6-by-1, matrix of doubles

Description

"On properties of floating point arithmetics: numerical stability and the cost of accurate computations" Douglas Priest, 1992 p62 "What is the smallest n for which simply compensated summation is not guaranteed to yield a result with a small forward relative error in an arithmetic which conforms to the IEEE 754 standard. The smallest known to the author is ... Then the exact sum is 2, but the sum computed by the SCS is 3."

Examples

x = accsum_priestx ( )
[s,e] = accsum_scs ( x ) // = 3 + 0
[s,e] = accsum_dcs ( x ) // = 2 + 0
<< accsum_order Support accsum_shuffle >>