Comparison of Interval and Ellipsoidal Bounds for the Errors of Vector Operations

摘要

We compare two approaches, the interval and the ellipsoidal ones, to the guaranteed estimation of errors of vector operations by considering the problem of multiplication of a vector by a matrix. It is shown that for a large class of linear operators the ellipsoidal estimates are more precise than the interval ones, even if the initial vector has interval error bounds.