Theory of linear and integer programming
Theory of linear and integer programming
On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set
SIAM Journal on Matrix Analysis and Applications
Interval natural frequency and mode shape analysis for truss structures with interval parameters
Finite Elements in Analysis and Design
On regular and singular interval systems
Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
Optimal value range in interval linear programming
Fuzzy Optimization and Decision Making
Interval natural frequency and mode shape analysis for truss structures with interval parameters
Finite Elements in Analysis and Design
AI methods in solving systems of interval linear equations
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Localized solutions to interval linear equations
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We characterize the solution set S of real linear system Ax = b by a set of inequalities if b lies between some given bounds b, b and if the n × n coefficient matrix A varies similarly between two bounds A and A. In addition, we restrict A to a particular class of matrices, for instance the class of the symmetric, the skew-symmetric, the persymmetric, the Toeplitz, and the Hankel matrices, respectively. In this way, we generalize the famous Oettli-Prager criterion (Numer. Math. 6 (1964) 405), results by Hartfiel (Numer. Math. 35 (1980) 355) and the contents of the papers (in: R.B. Kearfott, V. Kreinovich (Eds.), Applications of Interval Computations, Kluwer, Boston, MA, 1996, pp. 61-79) and (SIAM J. Matrix Anal. Appl. 18 (1997) 693).