Add a product to one interleaved twofold accumulator: high at 2index and
low at 2index+1. The caller owns complete storage and initializes both parts.
Ogita, Rump and Oishi (2005), algorithms 3.1, 3.3 and 5.3, derive the
TwoSum/TwoProduct correction used here:
https://www.tuhh.de/ti3/paper/rump/OgRuOi05.pdf
Binary64 splitting retains product rounding error and TwoSum retains addition
rounding error. Exact power-of-two transfers prevent splitter overflow; a
large product is scaled before the error calculation. Without underflow the
product decomposition is exact; underflow retains the paper's absolute-error
limitation. Nonfinite arithmetic propagates to the numerical owner's refusal.
This improves evaluation of the same coefficients, never their objective,
constraint, stabilization or convergence tolerances.
Add a product to one interleaved twofold accumulator: high at 2index and low at 2index+1. The caller owns complete storage and initializes both parts. Ogita, Rump and Oishi (2005), algorithms 3.1, 3.3 and 5.3, derive the TwoSum/TwoProduct correction used here: https://www.tuhh.de/ti3/paper/rump/OgRuOi05.pdf
Binary64 splitting retains product rounding error and TwoSum retains addition rounding error. Exact power-of-two transfers prevent splitter overflow; a large product is scaled before the error calculation. Without underflow the product decomposition is exact; underflow retains the paper's absolute-error limitation. Nonfinite arithmetic propagates to the numerical owner's refusal. This improves evaluation of the same coefficients, never their objective, constraint, stabilization or convergence tolerances.