Accuracy#
The bounds the differential fuzzer (make fuzz-linalg, and every week fuzz-long.yml) holds every answer to, on
adversarial matrices (clustered, repeated and graded spectra, rank deficiency, exact integers, entries scaled to
1e±150, complex data) at every kernel the processor has. Throughout, n is the larger dimension, ε = 2⁻⁵³,
‖·‖ the Frobenius norm and c = 50 n ε: a backward-stable algorithm’s error is a small multiple of n ε whatever
the conditioning, and a wrong update or deflation misses it by orders of magnitude.
Function |
What holds |
|---|---|
|
|
|
|
|
|
|
|
|
backward error |
|
the logarithm within `10⁻⁸ n · max(1, |
|
the solution within the perturbation bound of the rank kept ( |
|
each pair’s residual within |
|
within the rounding of their sums: |
|
the |
any of them |
the same bits on one thread as on all; a NaN or an infinity in what is read raises |
make fuzz-edges holds the element-wise operations and reductions to NumPy’s answers on signed zeros, infinities,
NaNs, values near overflow and empty axes.