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
Journal of Approximation Theory
Paper
Some properties of Chebyshev approximation in a subspace of Rn
Abstract
Let K be a subspace of Rn and let K⊥ be the orthogonal complement of K. Rockafellar has shown that certain properties of K may be characterized by considering the possible patterns of signs of the nonzero components of vectors of K and of K⊥. Such considerations are shown to lead to the standard characterization theorem for discrete linear Chebyshev approximation as well as to several results on uniqueness of solutions. A method is given for testing uniqueness of a given solution. A special case related to graph theory is discussed and combinatorial methods are given for solving and testing for uniqueness. © 1976.