论文信息 - COMPUTING EXACT COMPONENTWISE BOUNDS ON SOLUTIONS OF LINEAR SYSTEMS WITH INTERVAL DATA IS NP-HARD∗

COMPUTING EXACT COMPONENTWISE BOUNDS ON SOLUTIONS OF LINEAR SYSTEMS WITH INTERVAL DATA IS NP-HARD∗

We prove that it is NP-hard to compute the exact componentwise bounds on solutions of all the linear systems that can be obtained from a given linear system with a nonsingular matrix by perturbing all the data independently of each other within prescribed tolerances.

Vladik Kreinovich | Jiri Rohn | V. Kreinovich | J. Rohn | †. Jirirohn

[1] G. Alefeld,et al. Introduction to Interval Computation , 1983 .

[2] Eldon Hansen,et al. Bounding the solution of interval linear equations , 1992 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] A. Neumaier. Interval methods for systems of equations , 1990 .

[5] W. Oettli. On the Solution Set of a Linear System with Inaccurate Coefficients , 1965 .

[6] Jiri Rohn,et al. On nonconvexity of the solution set of a system of linear interval equations , 1990 .

[7] Siegfried M. Rump,et al. Solving Algebraic Problems with High Accuracy , 1983, IMACS World Congress.

[8] Willard L. Miranker,et al. A new approach to scientific computation , 1983 .

[9] J. Rohn. Systems of linear interval equations , 1989 .

[10] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..