Solving the full rank interval least squares problem
Applied Numerical Mathematics
On arithmetic operations of interval numbers
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Solving systems of linear fuzzy equations by parametric functions---An improved algorithm
Fuzzy Sets and Systems
A Possible Approach to Cope with Uncertainties in Space Applications
WILF '07 Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory
Artificial Intelligence
Solving systems of interval linear equations with use of modified interval division procedure
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
AI methods in solving systems of interval linear equations
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Expert Systems with Applications: An International Journal
Accurate solution of dense linear systems, Part II: Algorithms using directed rounding
Journal of Computational and Applied Mathematics
Hi-index | 0.01 |
Certain cases in which the interval hull of a system of linear interval equations can be computed inexpensively are outlined. We extend a proposed technique of Hansen and Rohn with a formula that bounds the solution set of a system of equations whose coefficient matrix $ {\bf{A}}= [ \underline A, \overline A ]$ is an H-matrix; when ${\bf A}$ is centered about a diagonal matrix, these bounds are the smallest possible (i.e., the bounds are then the solution hull). Hansen's scheme also computes the solution hull when the linear interval system ${\bf{A}}{\bf{x}}={\bf{b}}=[{\underline b}, {\overline b}]$ is such that ${\bf{A}}$ is inverse positive and ${\underline b}=- {\overline b} \neq 0$. Earlier results of others also imply that, when ${\bf{A}}$ is an M-matrix and ${\bf{b}} \geq 0, {\bf{b}} \leq 0$, or $0 \in {\bf{b}}$, interval Gaussian elimination (IGA) computes the hull. We also give a method of computing the solution hull inexpensively in many instances when ${\bf A}$ is inverse positive, given an outer approximation such as that obtained from IGA. Examples are used to compare these schemes under various conditions.