Detecting Unsolvability of Interval Linear Systems

Jaroslav Horáček, Jan Horáček, Milan Hladík · Kalpa publications in computing · 2018

In this paper we deal with detection of unsolvability of interval linear systems. Various methods based on existing algorithms or on existing sufficient conditions are developed. The methods are tested on a large variety of random systems and the results are visualized. The two strongest sufficient conditions are proved to be equivalent under a certain assumption. The topic of detecting solvability is also touched upon.

Read the paper · More papers on PaperTik