Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
From MaRDI portal
(Redirected from Publication:4835403)
Recommendations
- Calculation of exact bounds for the solution set of linear interval systems
- Checking bounds on solutions of linear interval equations is NP-hard
- Enclosing solutions of linear interval equations is NP-hard
- Complexity of some linear problems with interval data
- scientific article; zbMATH DE number 804135
Cited in
(35)- An NP-hardness result for nonlinear systems
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow
- Enclosing solutions of linear interval equations is NP-hard
- Complexity of some linear problems with interval data
- Why it is computationally harder to reconstruct the past than to predict the future
- Enclosing the solution set of parametric interval matrix equation \(A(p)X = B(p)\)
- Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations
- Centered solutions for uncertain linear equations
- Solving interval linear systems with linear programming techniques
- Checking bounds on solutions of linear interval equations is NP-hard
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
- Approximate linear algebra is intractable
- Checking robust nonsingularity of tridiagonal matrices in linear time
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- The interval Lyapunov matrix equation: analytical results and an efficient numerical technique for outer estimation of the united solution set
- An efficient framework for barrier certificate generation of uncertain nonlinear hybrid systems
- Proving endpoint dependence in solving interval parametric linear systems
- An algorithm for computing the hull of the solution set of interval linear equations
- How to determine basis stability in interval linear programming
- Linear interval equations: Midpoint preconditioning may produce a 100\% overestimation for arbitrarily narrow data even in case \(n = 4\)
- A comparison of metaheurisitics for the problem of solving parametric interval linear systems
- Vertex solution theorem for the upper and lower bounds on the dynamic response of structures with uncertain-but-bounded parameters
- Inaccurate linear equation system with a restricted-rank error matrix
- On the interval generalized coupled matrix equations
- scientific article; zbMATH DE number 804135 (Why is no real title available?)
- scientific article; zbMATH DE number 869739 (Why is no real title available?)
- Positively regular vague matrices
- Calculation of exact bounds for the solution set of linear interval systems
- scientific article; zbMATH DE number 7695062 (Why is no real title available?)
- Complexity issues in interval linear programming
- Strong NP-completeness of a matrix similarity problem
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
- Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- Direct methods for linear systems with inexact input data
- Reliable modeling and optimization for chemical engineering applications: Interval analysis approach
This page was built for publication: Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835403)
