Jansson, ChristianChristianJanssonRohn, JiříJiříRohn2021-04-222021-04-221999-01-01SIAM Journal on Matrix Analysis and Applications 20 (3): 756-776 (1999-01-01)http://hdl.handle.net/11420/9348Checking 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.en1095-716219993756776Soc.AlgorithmBranch-and-boundInterval matrixLinear interval equationsLinear programmingRegularitySingularityInformatikMathematikJournal Article10.1137/S0895479896313978Other