Options
An algorithm for checking regularity of interval matrices
Publikationstyp
Journal Article
Date Issued
1999-01-01
Sprache
English
Author(s)
Institut
TORE-URI
Volume
20
Issue
3
Start Page
756
End Page
776
Citation
SIAM Journal on Matrix Analysis and Applications 20 (3): 756-776 (1999-01-01)
Publisher DOI
Scopus ID
Publisher
Soc.
Checking regularity (or singularity) of interval matrices is a known NP-hard problem. In this paper a general algorithm for checking regularity/singularity is presented which is not a priori exponential. The algorithm is based on a theoretical result according to which regularity may be judged from any single component of the solution set of an associated system of linear interval equations. Numerical experiments (with interval matrices up to the size n = 50) confirm that this approach brings an essential decrease in the amount of operations needed.
Subjects
Algorithm
Branch-and-bound
Interval matrix
Linear interval equations
Linear programming
Regularity
Singularity
DDC Class
004: Informatik
510: Mathematik