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.
Abstract
Let A be a symmetric matrix with entries (0, 1, -1) and λ1(A) its smallest eigenvalue. We consider the question of how closely A-λ1(A)I can be approximated by a gramian KKT, where each entry in K is 0, 1, or -1. © 1977 D. Reidel Publishing Company.