Open AccessDetecting Unsolvability of Interval Linear Systems
Author(s) -
Jaroslav Horáček,
J. Horáček,
Milan Hladík
Publication year - 2018
Publication title -
kalpa publications in computing
Language(s) - English
Resource type - Conference proceedings
ISSN - 2515-1762
DOI - 10.29007/ptx4
Subject(s) - variety (cybernetics) , interval (graph theory) , linear system , computer science , algorithm , mathematics , artificial intelligence , combinatorics , mathematical analysis
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.