Abstract
Criteria for symmetry and boundedness are found for the combined solution set of a system of linear algebraic equations with interval coefficients. It is shown that the problem of the best inner interval estimation of a symmetric solution set can be exactly solved by linear programming methods.
Similar content being viewed by others
References
S. P. Sharyi, Interval Algebraic Problems and Their Numerical Solution, Doctoral Dissertation in Mathematics and Physics (Novosibirsk, 2000).
C. Jansson, “Calculation of Exact Bounds for the Solution Set of Linear Interval Systems,” Linear Algebra Appl., 251, 321–340 (1997).
S. Poljak and J. Rohn, “Cheking Robust Nonsingularity Is NP-Hard,” Math. Control, Signals, Syst. 6, 1–9 (1993).
J. Rohn and V. Kreinovich, “Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data Is NP-Hard,” SIAM J. Math. Analys. Appl. 6, 415–420 (1995).
W. Oettli and W. Prager, “Compatibility of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-Hand Sides,” Numer. Math., 6, 405–409 (1964).
L. T. Ashchepkov, “On the Construction of Maximal Cube Inscribed in a Given Domain,” Zh. Vychisl. Mat. Mat. Fiz., 30, 510–513 (1980).
L. T. Ashchepkov and U. Badam, Models and Methods for Improving the Vitality of Control Systems (Dal’nauka, Vladivostok, 2006) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © L.T. Ashchepkov, 2008, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2008, Vol. 48, No. 4, pp. 562–569.
Rights and permissions
About this article
Cite this article
Ashchepkov, L.T. Linear interval equations with symmetric solution sets. Comput. Math. and Math. Phys. 48, 531–538 (2008). https://doi.org/10.1134/S0965542508040027
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542508040027