Bounding the error for approximate solutions of almost linear complementarity problems using feasible vectors

摘要

In this paper we use the concept of a feasible vector in order to bound a solution x*of an almost linear complementarity problem in a certain set. This set delivers also componentwise error bounds for an approximation to a solution x*. In the special case that the problem is defined by a so-called H-matrix, we prove that the error bounds are more accurate than the corresponding bounds recently obtained. By numerical examples it will be demonstrated that the new bounds can be better by several orders of magnitude.