Abstract
The problem of solving iteratively a large and possibly sparse system of interval linear inequalities α ≤ Ax ≤ β is considered. An algorithm of the row-action type is proposed which, in each iterative step, effectively takes account of a pair of inequalities describing a single interval inequality. The algorithm realizes in an automatic manner a relaxation principle proposed by Goffin but also allows further external relaxation parameters.
Original language | English |
---|---|
Pages (from-to) | 19-25 |
Number of pages | 7 |
Journal | Journal of Mathematical Analysis and Applications |
Volume | 106 |
Issue number | 1 |
DOIs | |
State | Published - 15 Feb 1985 |
Externally published | Yes |
ASJC Scopus subject areas
- Analysis
- Applied Mathematics