An algorithm for computing the hull of the solution set of interval linear equations

DOI10.1016/j.laa.2011.02.021zbMath1253.65064MaRDI QIDQ2431184

Jiří Rohn

Publication date: 11 April 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.02.021

zbMATH Keywords

algorithm; solution set; interval hull; interval linear equations; absolute value inequality

Mathematics Subject Classification ID

65G30: Interval and finite arithmetic

Related Items

A general method for enclosing solutions of interval linear equations, Primal-dual bilinear programming solution of the absolute value equation, Absolute value equation solution via dual complementarity, Checking weak optimality of the solution to linear programming with interval right-hand side

Uses Software

• INTLAB
• VERSOFT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general method for enclosing solutions of interval linear equations
• Systems of linear interval equations
• Die Überschätzung des Wertebereichs einer Funktion in der Intervallrechnung mit Anwendungen auf lineare Gleichungssysteme
• 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
• Linear Optimization Problems with Inexact Data
• On the Solution Set of a Linear System with Inaccurate Coefficients
• Calculation of exact bounds for the solution set of linear interval systems