Self-verified extension of affine arithmetic to arbitrary order

Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results.In this paper we propose a higher-order extension satisfying the requirements of genericity, arbitrary-order and self-verification, comparing the resulting ethod with other well-known high-order extensions of AA.