Interval Linear Algebra and Computational Complexity
From MaRDI portal
Publication:4554518
DOI10.1007/978-3-319-49984-0_3OpenAlexW2258109786MaRDI QIDQ4554518
Jaroslav Horáček, Michal Černý, Milan Hladík
Publication date: 14 November 2018
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00349
computational complexitydecision problemsNP-hardnessco-NP-hardnessfunctional problemsinterval linear algebra
Related Items (2)
On preconditioning and solving an extended class of interval parametric linear systems ⋮ Stability of the linear complementarity problem properties under interval uncertainty
Cites Work
- AE solutions and AE solvability to general interval linear systems
- Systems of linear interval equations
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Several NP-hard problems arising in robust stability analysis
- Computational complexity and feasibility of data processing and interval computations
- Mathematical problems for the next century
- Computing exact bounds on elements of an inverse interval matrix is NP-hard
- A new technique in systems analysis under interval uncertainty and ambiguity
- Enclosing solutions of overdetermined systems of linear interval equations
- Complexity issues for the symmetric interval eigenvalue problem
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
- Solving overdetermined systems of interval linear equations
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Tight Bounds on the Radius of Nonsingularity
- On full-rank interval matrices
- Perron vectors of an irreducible nonnegative interval matrix
- Introduction to Interval Analysis
- Interval Methods for Systems of Equations
- Interval Matrices: Singularity and Real Eigenvalues
- Inverse Interval Matrix
- Sufficient Conditions for Regularity and Singularity of Interval Matrices
- Positive Definiteness and Stability of Interval Matrices
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- An algorithm for checking stability of symmetric interval matrices
- Computational Complexity
- New Operator and Method for Solving Real Preconditioned Interval Linear Equations
- Linear Optimization Problems with Inexact Data
- A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
- Large-Scale Scientific Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Interval Linear Algebra and Computational Complexity
