Sufficient Conditions for the Joined Set of Solutions of the Overdetermined Interval System of Linear Algebraic Equations Membership to Only One Orthant

06/20/2022
by   Vladimir Erokhin, et al.
0

Interval systems of linear algebraic equations (ISLAE) are considered in the context of constructing of linear models according to data with interval uncertainty. Sufficient conditions for boundedness and convexity of an admissible domain (AD) of ISLAE and its belonging to only one orthant of an n-dimensional space are proposed, which can be verified in polynomial time by the methods of computational linear algebra. In this case, AD ISLAE turns out to be a convex bounded polyhedron, entirely lying in the corresponding ortant. These properties of AD ISLAE allow, firstly, to find solutions to the corresponding ISLAE in polynomial time by linear programming methods (while finding a solution to ISLAE of a general form is an NP-hard problem). Secondly, the coefficients of the linear model obtained by solving the corresponding ISLAE have an analogue of the significance property of the coefficient of the linear model, since the coefficients of the linear model do not change their sign within the limits of the AD. The formulation and proof of the corresponding theorem are presented. The error estimation and convergence of an arbitrary solution of ISLAE to the normal solution of a hypothetical exact system of linear algebraic equations are also investigated. An illustrative numerical example is given.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2020

Sylvester-type quaternion matrix equations with arbitrary equations and arbitrary unknowns

In this paper, we prove a conjecture which was presented in a recent pap...
research
04/22/2023

Stability of solutions of systems of Volterra integral equations

In this paper we propose new sufficient conditions for stability of solu...
research
03/15/2019

Numerical computation of formal solutions to interval linear systems of equations

The work is devoted to the development of numerical methods for computin...
research
12/02/2020

Computing bounds for imprecise continuous-time Markov chains using normal cones

The theory of imprecise Markov chains has achieved significant progress ...
research
11/22/2013

Finding sparse solutions of systems of polynomial equations via group-sparsity optimization

The paper deals with the problem of finding sparse solutions to systems ...
research
09/14/2022

Properties of the solution set of absolute value equations and the related matrix classes

The absolute value equations (AVE) problem is an algebraic problem of so...
research
05/12/2018

Optimal switching sequence for switched linear systems

We study a discrete optimization problem over a dynamical system that co...

Please sign up or login with your details

Forgot password? Click here to reset