Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositions (Q5903063): Difference between revisions

We present a class of iterative methods to enclose the solution set \(\{x| Ax=b,A\in {\mathcal A},b\in b\}\) by an interval vector; A is varying in an \(n\times n\) interval H-matrix \({\mathcal A}\) and b is varying in an interval vector \(b\). the algorithm taken into consideration generalizes an interative method of \textit{J. A. Meijerink} and \textit{H. A. van der Vorst} [Math. Comput. 31, 148-162 (1977; Zbl 0349.65020)] based on an incomplete LU-decomposition of an M-matrix A. Theorems concerning the feasibility of the algorithm, its rate of convergence and its quality of enclosure are given. Since the original method of Meijerink and van der Vorst is a special case of our algorithm we have thus shown this applicability to the larger class of H-matrices. Furthermore we relate the \(R_ 1\)-factor of the original method to the underlying set P of indices.