A Simplex-Like Algorithm for Interval Linear Systems
Year: 1997
Type: article
Abstract: : In this paper, we show how it is possible to use convex polyhedra for solving linear interval systems without using preconditionning. We first show how to derive, from an enclosure of 2\\Sigma([A]; [b]), a polyhedron which contains the convex hull of the solution set. Then, a simplex-like method enables us to find a new outer inclusion. Moreover, the constraints obtained may be used to compute an inner inclusion of 2\\Sigma([A]; [b]). Key-words: interval linear systems, simplex algorithm (R'esum'e : tsvp) * Institut de Recherche en Informatique et Syst`emes Al'eato ires - email:[email protected] CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (URA 227) Universit e de Rennes 1 -- Insa de Rennes et en Automatique -- unit e de recherche de Rennes Un algorithme de type Simplexe pour r'esoudre les syst`emes lin'eaires avec intervalles. R'esum'e : Dans cet article, nous montrons comment il est possi...
Author: Olivier Beaumont
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2616157691