Computational Aspects of Approximation Theory.

Barry W. Boehm

ResearchPublished 1964

A discussion of the theory of approximation by polynomials and rational functions, presenting some of the useful theoretical results, interrelations, and practical consequences. Topics include problems of existence, uniqueness, characterization, and error estimation of best approximations, as well as algorithms for interpolation and for obtaining best least-squares and Chebyshev approximations. 107 pp. Bibliog

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1964
  • Pages: 107
  • Document Number: RM-4051-PR

Citation

Chicago Manual of Style

Boehm, Barry W., Computational Aspects of Approximation Theory. Santa Monica, CA: RAND Corporation, 1964. https://www.rand.org/pubs/research_memoranda/RM4051.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.