We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for this case, comparing and refinement of both. We show that the latter bounds are not provable better, and that they are also sometimes too pessimistic. The presented form of both methods is suitable for combining them into one to get a more efficient algorithm. Some numerical experiments are carried out to illustrate performances of the methods.
Let A and B be M-matrices satisfying A ≤ B and J = [A,B] be the set of all matrices C such that A ≤ C ≤ B, where the order is component wise. It is rather well known that if A is an M-matrix and B is an invertible M-matrix and A ≤ B, then aA + bB is an invertible M-matrix for all a,b > 0. In this article, we present an elementary proof of a stronger version of this result and study corresponding results for certain other classes as well.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.