Detecting Unsolvability of Interval Linear Systems

16 pages•Published: October 11, 2018

Jaroslav Horáček, Jan Horáček and Milan Hladík

Abstract

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.

Keyphrases: full column rank, interval linear systems, unsolvability, unsolvability gap

In: Matthieu Martel, Nasrine Damouche and Julien Alexandre Dit Sandretto (editors). TNC'18. Trusted Numerical Computations, vol 8, pages 54-69.

Links:	https://easychair.org/publications/paper/ZNM2
	https://doi.org/10.29007/ptx4

BibTeX entry

@inproceedings{TNC'18:Detecting_Unsolvability_Interval_Linear,
  author    = {Jaroslav Horáček and Jan Horáček and Milan Hladík},
  title     = {Detecting Unsolvability of Interval Linear Systems},
  booktitle = {TNC'18. Trusted Numerical Computations},
  editor    = {Matthieu Martel and Nasrine Damouche and Julien Alexandre Dit Sandretto},
  series    = {Kalpa Publications in Computing},
  volume    = {8},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/ZNM2},
  doi       = {10.29007/ptx4},
  pages     = {54-69},
  year      = {2018}}

Download PDF Open PDF in browser