About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Mathematics of Computation
Paper
On the nonsingularity of real matrices
Abstract
By exploiting the theory of linear inequalities, new bounds for the real eigenvalues of a real matrix are derived, along with sufficient conditions for matrix games to be completely mixed, for determinants to be positive, etc. TBf simple observation on which the derivation of new results and the unification of old results are based is that the typical conditions of diagonal dominance which insure the nonsingularity of matrices are essentially systems of linear inequalities on the rowsof the matrices. © 1965 American Mathematical Society.