Linear interval equations: Midpoint preconditioning may produce a 100% overestimation for arbitrarily narrow data even in case n = 4

Reliable Computing

Volumn 11, Issue 2, 2005, Pages 129-135

  Rohn, Jiří ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR SYSTEMS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING; VECTORS;

INTERVAL HULL; INTERVAL MATRIX; LINEAR INTERVAL EQUATIONS; LINEAR INTERVAL SYSTEM;

LINEAR EQUATIONS;

EID: 18244375229     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11155-005-3033-5     Document Type: Article

References (9)

1. Blick, C.: Computer Methods for Design Automation, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, 1992.
2. Hansen, E. R.: Bounding the Solution of Interval Linear Equations, SIAM Journal on Numerical Analysis 29 (1992), pp. 1493-1503.
3. Neumaier, A.: A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott Enclosure for Linear Interval Equations, Reliable Computing 5 (2) (1999), pp. 131-136.
4. Ning, S. and Kearfott, R. B.: A Comparison of Some Methods for Solving Linear Interval Equations, SIAM Journal on Numerical Analysis 34 (1997), pp. 1289-1305.
5. Oettli, W. and Prager, W.: Compatibility of Approximate Solution of Linear Equations with Given Error Bounds for Coefficients and Right-Hand Sides, Numerische Mathematik 6 (1964), pp. 405-409.
6. Rohn, J.: Systems of Linear Interval Equations, Linear Algebra and Its Applications 126 (1989), pp. 39-78.
7. Rohn, J.: Cheap and Tight Bounds: The Recent Result by E. Hansen Can Be Made More Efficient, Interval Computations 4 (1993), pp. 13-21.
8. ∞,l Is NP-Hard, Linear and Multilinear Algebra 47 (2000), pp. 195-204.
9. Rohn, J. and Kreinovich, V.: Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data Is NP-Hard, SIAM Journal on Matrix Analysis and Applications 16 (1995), pp. 415-420.