Inaccurate linear equation system with a restricted-rank error matrix
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.
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- scientific article; zbMATH DE number 3492435 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- On nonconvexity of the solution set of a system of linear interval equations
- Optimale Lösung von Intervallgleichungssystemen
- Sign-stable solutions of column-vague linear equation systems
- Systems of linear interval equations
- Vague matrices in linear programming
This page was built for publication: Inaccurate linear equation system with a restricted-rank error matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208348)
