Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data isNP-Hard

Authors:
Jiri Rohn;Vladik Kreinovich
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1995

Citing 0
Cited 7

Computationally complicated problems of numerical computations (in particular, interval computations), biofeedback, computer games, and Gulf War: an idea

ACM SIGNUM Newsletter
A global optimization method for solving parametric linear systems whose input data are rational functions of interval parameters

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
A comparison of metaheurisitics for the problem of solving parametric interval linear systems

NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Scalable parallel interval propagation for sparse constraint satisfaction problems

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Differential evolution applied to large scale parametric interval linear systems

LSSC'11 Proceedings of the 8th international conference on Large-Scale Scientific Computing
Parallel execution in metaheuristics for the problem of solving parametric interval linear systems

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Heterogeneous multi-agent evolutionary system for solving parametric interval linear systems

PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.