Inaccurate linear equation system with a restricted-rank error matrix (Q4208348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1195660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inaccurate linear equation system with a restricted-rank error matrix |
scientific article; zbMATH DE number 1195660 |
Statements
Inaccurate linear equation system with a restricted-rank error matrix (English)
0 references
24 February 1999
0 references
interval linear equation system
0 references
solution set analysis
0 references
inaccurate linear equation system
0 references
restricted-rank error matrix
0 references
0.7748774290084839
0 references
0.7523358464241028
0 references
0.7500692009925842
0 references
The author studies a system of linear equations \[ (A + Y P^T)x = b, \] where \(A\) and \(P\) are constant \(m\times n\) and \(n\times r\)-matrices, respectively; \(Y\) and \(b\) can be taken from given sets. The basic aim of the paper is to show that the solution set analysis can be simplified substantially provided the rank of the error matrix is restricted even if the assumption of interval character of data errors is replaced by a more general one. (It s well known that the solution set of an interval linear equation system is a union of convex polyhedral. The number of these polyhedral increases, in general exponentially, with the problem size. As a consequence, the problem of finding the interval hull of the solution set is \textbf{NP}-hard --- J. Rohn and V. Kreinovich's results). In the case of rank one error matrices the author shows that we have to look into at most two convex subsets. A dual approach to describing the solution set is discussed, too.
0 references