Thresholded stopping of a capped-tolerance multiplier search

ID: thresholded-stopping-of-a-capped-tolerance-multiplier-search

Thresholded stopping of a capped-tolerance multiplier search ends a numerical allocation when a feasible physical budget is sufficiently well used. With the decreasing budget function in tolerance-budget residual bound for multiplier bisection, an exact upper bracket endpoint satisfies . A residual requirement is , where has the same physical units as the permitted deterministic bias . A small change in alone does not establish that condition.
Numerical evaluation also needs a bound. Suppose the reported value has validated absolute error . Both feasibility and the residual requirement are certified if
Equivalently, the acceptable reported value lies in
This window is empty if . Iterating the multiplier more accurately cannot by itself overcome an evaluation-error bound larger than the desired physical certificate.
For an original numerical certificate, let , and . Values are certifiable. A reported places the actual budget in , so it is feasible and leaves at most unused. A reported is closer to ten but could represent and therefore does not certify feasibility.
The evaluation allowance must itself be justified, for example by validated arithmetic or an explicit forward-error analysis. Uncertain physical coefficients also need their stipulated worst-case bounds before the numerical sum can certify the physical error. NIST's pulse-radiometer discussion motivates the offset and leakage terms; it does not provide the hypothetical numerical tolerances above.[ref]

New to topics? Read the docs here!