On Polynomial Approximation in the Uniform Norm by the Discrete Least Squares Method.

Abstract

The discrete least squares method is convenient for computing polynomial approximations to functions. We investigate the possibility of using this method to obtain polynomial approximants good in the uniform norm, and describe applications both to the case when the function to be approximated s known on a discrete point set only and to the case when we can freely choose the set of least squares nodes. Numerical examples are presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1983
Accession Number
ADA127693

Entities

People

  • Lothar Reichel

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Analytic Functions
  • Chebyshev Polynomials
  • Complex Variables
  • Conformal Mapping
  • Continents
  • Convergence
  • Distribution Functions
  • Functions (Mathematics)
  • Interpolation
  • Intervals
  • Least Squares Method
  • Mathematical Analysis
  • Mathematics
  • North Carolina
  • Polynomials
  • United States
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Distributed Systems and Data Platform Development
  • Statistical inference.