[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

A note on best one-sided approximations

Published: 01 September 1971 Publication History

Abstract

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]).

References

[1]
Cody, W.J., Fraser, W., and Hart, J.F. Rational Chebyshev approximation using linear equations. Numer. Math. 12 (1968), 242-251.
[2]
Machly, Hans J. Approximations for the Control Data 1604. In Approximations for the square root, Proj. N.R. 044.196, Princeton U., Princeton, N.J., Jan. 1960, Ch. 1, pp. 3-11.
[3]
Cody, W.J. Double-precision square root for the CDC 3600. Comm. ACM 7, 12 (Dec. 1964), 715-718.
[4]
King, Richard F., and Phillips, David L. The logarithmic error and Newton's method for the square root. Comm. ACM. 12, 2 (Feb. 1969), 87-88.
[5]
Sterbenz, P.H., and Fike, C.T. Optimal starting approximations for Newton's method. Math. Comput. 23 (1969), 313-318.
[6]
King, Richard. Improved Newton iteration for integral roots. Math. Comput. 25 (1971), 299-304.
[7]
Phillips, David L. Generalized logarithmic error and Newton's method for the m-th root. Math. Comput. 24 (1970), 383-389.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 14, Issue 9
Sept. 1971
36 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/362663
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1971
Published in CACM Volume 14, Issue 9

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. best approximation
  2. error
  3. logarithmic
  4. one-sided approximation
  5. relative error

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)67
  • Downloads (Last 6 weeks)7
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media