Solving interval linear systems with lin
โ
O. Beaumont
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 919 KB
In this paper, we show how it is possible to use convex polyhedra for solving linear interval systems without using preconditioning. We first show how to derive, from an enclosure of t3Z'([A], [b]), a polyhedron which contains the convex hull of the solution set, Then, a simplex-like method enables