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-2zbMATH Open1180.65055OpenAlexW2166586303MaRDI QIDQ956687FDOQ956687
Authors: Ralph Baker Kearfott 
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
Recommendations
preconditioningpreconditionerinterval linear systemsinterval Gauss-Seidel methoddisconnected solution setextended intervals
Cites Work
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Interior Methods for Mathematical Programs with Complementarity Constraints
- 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
- Linear systems with large uncertainties, with applications to truss structures
- Preconditioners for the Interval Gauss–Seidel Method
- Validated Linear Relaxations and Preprocessing: Some Experiments
- On the Solution Set of a Linear System with Inaccurate Coefficients
- Interval arithmetic with containment sets
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)
