COMPUTATIONAL ASPECTS OF APPROXIMATION THEORY,

Abstract

The theory of approximation by polynomials and rational functions is of considerable practical significance, due in great part to the efficiency of polynomials and rational functions in representing functions on a high-speed digital computer. Some of the more useful theoretical results are presented along with their interrelations and some of the practical consequences are pointed out. Topics include problems of existence, uniqueness, characterization, and error estimation of best approximations, and algorithms for interpolation and for obtaining best leastsquares and Chebyshev approximations. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1964
Accession Number
AD0433175

Entities

People

  • Barry Boehm

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Chebyshev Approximations
  • Computers
  • Computing Devices
  • Digital Computers
  • Efficiency
  • Interpolation
  • Mathematical Analysis
  • Mathematics
  • Polynomials
  • Rational Functions

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Calculus or Mathematical Analysis