A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
From MaRDI portal
Publication:956687
DOI10.1007/s00607-008-0258-2zbMath1180.65055OpenAlexW2166586303MaRDI QIDQ956687
Publication date: 25 November 2008
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-008-0258-2
preconditioningpreconditionerinterval linear systemsinterval Gauss-Seidel methoddisconnected solution setextended intervals
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interval arithmetic with containment sets
- Linear systems with large uncertainties, with applications to truss structures
- Rigorous global search: continuous problems
- Computational complexity and feasibility of data processing and interval computations
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Preconditioners for the Interval Gauss–Seidel Method
- Interval Methods for Systems of Equations
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Interior Methods for Mathematical Programs with Complementarity Constraints
- On the Solution Set of a Linear System with Inaccurate Coefficients
This page was built for publication: A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
