Solving interval linear systems with linear programming techniques
From MaRDI portal
Publication:1808960
DOI10.1016/S0024-3795(98)10044-7zbMath0934.65045WikidataQ114850252 ScholiaQ114850252MaRDI QIDQ1808960
Publication date: 7 February 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
linear programmingiterative methodinterval arithmeticconvex hullsimplex-like methodlinear interval systemsinner inclusionouter inclusion
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10)
Related Items (8)
Estimation of algebraic solution by limiting the solution set of an interval linear system ⋮ A new robust model of one-class classification by interval-valued training data using the triangular kernel ⋮ On the algebraic solution of fuzzy linear systems based on interval theory ⋮ Binary classification SVM-based algorithms with interval-valued training data using triangular and Epanechnikov kernels ⋮ A new approach to obtain algebraic solution of interval linear systems ⋮ Characterizing and approximating eigenvalue sets of symmetric interval matrices ⋮ An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices ⋮ Solving fully interval linear systems of equations using tolerable solution criteria
Cites Work
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- On the solution of interval linear systems
- Checking bounds on solutions of linear interval equations is NP-hard
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving interval linear systems with linear programming techniques
