By David L. Phillips
Communications of the ACM,
September 1971,
Vol. 14 No. 9, Pages 598-600
10.1145/362663.362743
Comments
In this note we consider the relationship between best approximations and best one-sided approximations for three different measures of goodness of fit. For these measures simple relationships exist between best approximations and best one-sided approximations. In particular it is shown that a best approximation and best one-sided approximation differ only by a multiplicative constant when the measure is the uniform norm of the relative error. In this case problems involving best one-sided approximations can be reduced to problems involving best approximations. The result is especially significant if one wants to numerically determine a best one-sided approximation, since algorithms exist for numerically determining best approximations when the measure is the uniform norm of the relative error (see, for example, [1]).
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.