Affiliation:
1. Department of Computer Science, The University of Western Ontario, London 72, Ontario, Canada
Abstract
Chebyshev approximation on an interval and closed subsets by a Haar subspace are considered. The closeness of best approximations on subsets to the best approximation on the interval is examined. It is shown that under favorable conditions the difference is
O
((density of the subset)
2
), making it unnecessary to use very large finite subsets to get good approximations on the interval.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献