An Algorithm for Checking Regularity of Interval Matrices

DOI10.1137/S0895479896313978zbMath0931.65045OpenAlexW2050703079MaRDI QIDQ4243527

Christian Jansson, Jiří Rohn

Publication date: 18 May 1999

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479896313978

zbMATH Keywords

algorithmregularitylinear programmingbranch-and-boundsingularitylinear interval equationsinterval matrix

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Interval and finite arithmetic (65G30)

Related Items

Regularity radius and real eigenvalue range, Principal Component Analysis for Non-Precise Data, Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach, Principal minors. I: A method for computing all the principal minors of a matrix, Solution of the fully fuzzy linear systems using the decomposition procedure, Inverse of a fuzzy matrix of fuzzy numbers, Interval linear systems: the state of the art, Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets, An algorithm for addressing the real interval eigenvalue problem, Determining the positive definiteness margin of interval matrices, On solving vague systems of linear equations with pattern-shaped columns, Analysis and design of robust controllers using the interval Diophantine equation, Regularity radius: Properties, approximation and a not a priori exponential algorithm, On \(P\)-matrices