A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
From MaRDI portal
(Redirected from Publication:956687)
Recommendations
Cites work
- scientific article; zbMATH DE number 1397288 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Computational complexity and feasibility of data processing and interval computations
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Interval Methods for Systems of Equations
- Interval arithmetic with containment sets
- Linear systems with large uncertainties, with applications to truss structures
- On the Solution Set of a Linear System with Inaccurate Coefficients
- Preconditioners for the Interval Gauss–Seidel Method
- Rigorous global search: continuous problems
- Validated Linear Relaxations and Preprocessing: Some Experiments
Cited in
(4)
This page was built for publication: A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q956687)