Back to search

Boston University

Chebyshev approximation by piecewise continuous functions

Abstract

dc:description.abstract

This paper discusses the following problem of approximation theory: a continuous function f(x) is to approximated over an interval alpha </= x </= B by N not necessarily connected polynomials of a given degree n, in such a way that the maximum error magnitude is a minimum. Each polynomial is associated with one subinterval [uj, uj+1]. If the end points Ui were specified in advance, the problem would reduce to N independent problems of the same type, namely, the fitting of a single polynomial in the Chebyshev sense. Here, however, the end points are taken as unknowns and the principal problem is to determine them. The paper presents a proof of the existence of the best approximation and examples showing the solution, in general, is not unique. However, in the special case of approximation of convex functions by line segments, the solution is shown to be unique. Further in this case a simple characterization of the solution is obtained and it is shown that the problem may be reduced analytically to a stage where in order to determine Ui computationally, it is only necessary to solve a system of equations rather than minimize a function. Results obtained by a dynamic programming method using a digital computer (IBM 7090) are used for illustration.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
Boston University
Year dc:date.issued
1965

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chand, Donald Rajinder

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Barcode
11719025467533
Dc Identifier Bibid
99190910420001161
Dc Identifier Other
b14621903

Chain of custody

source
Harvested from
Boston University
Base URL
open.bu.edu/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chand, Donald Rajinder. Chebyshev approximation by piecewise continuous functions. doctoral thesis, Boston University, 1965. https://hdl.handle.net/2144/35374