Ellipsoidal admissibility test for overlap data

ID: ellipsoidal-admissibility-test-for-overlap-data

An ellipsoidal admissibility test for overlap data checks whether every point of a specified joint calibration ellipsoid permits finite Gaussian radius inversion. For the inversion of a symmetric Gaussian overlap log-ratio, write with the measured logarithmic ratio and the positive radius-setting parameter. The admissible set is and . Together these strict inequalities already imply .
Suppose the joint set is
For nonsingular this is equivalently . The parameterized form also accommodates a singular covariance matrix or a lower-dimensional deterministic set. Its support function in direction is
Indeed, , so the Cauchy-Schwarz inequality gives the bound, attained by a parallel when .
Let , marginal scales , and off-diagonal entry . Substituting and gives two exact tests:
Both must hold. Equality means that the closed joint set touches a boundary where no finite positive radius ratio exists; testing only the center would miss that point.
For an original example, take , , , and . Zero covariance gives upper-boundary excursion , smaller than the central margin . The lower-boundary test also passes. With correlation coefficient , however, and the upper excursion becomes : the joint set crosses the forbidden region despite identical marginal scales.
The offending point need not be found by grid search. When , the maximizing point is
For the correlated example and , this gives approximately , with . It is a concrete incompatible calibration pair.
The ellipsoid here is a stated joint set. Interpreting it as a confidence region requires a separate sampling or uncertainty model; choosing alone supplies no universal coverage probability. JCGM 101 distinguishes assignment of joint input distributions from propagation and summaries.[ref] If the set fails, report the incompatible region and reconsider the input model or measurement. Clipping it before inversion changes the set being propagated.

New to topics? Read the docs here!