Add to ORKG(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Mumford, David Bryant, and Jayant Shah. 1989. Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applie
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
The methods discussed are based on local piecewise-linear secant approximations to continuous conve...
AbstractWe list and discuss published programs for best approximation of functions by linear and non...
An optimal choice of segment boundaries in piecewise approximation is shown to be soluble by means o...
In 1957, E. Ya. Remez published a monograph devoted to numerical methods of Chebyshev approximation...
A necessary condition for a best Chebyshev approximation by piecewise linear functions is derived us...
summary:In the paper, we are concerned with some computational aspects of smooth approximation of da...
The consecutive numbering of the publications is determined by their chronological order. The aim of...
AbstractThe problem considered is that of finding a best uniform approximation to a real function f ...
Thesis (Ph.D.)--Boston UniversityPLEASE NOTE: Boston University Libraries did not receive an Authori...
In this paper we consider sequences of best approximation. We first examine the rho best approximati...
AbstractIn this paper an efficient method is presented for solving the problem of approximation of c...
In the paper, we are concerned with some computational aspects of smooth approximation of data. This...
This paper describes a fast and reliable algorithm which computes smooth piecewise polynomial approx...
BV functions cannot be approximated well by piecewise constant functions, but this work will show th...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
The methods discussed are based on local piecewise-linear secant approximations to continuous conve...
AbstractWe list and discuss published programs for best approximation of functions by linear and non...
An optimal choice of segment boundaries in piecewise approximation is shown to be soluble by means o...
In 1957, E. Ya. Remez published a monograph devoted to numerical methods of Chebyshev approximation...
A necessary condition for a best Chebyshev approximation by piecewise linear functions is derived us...
summary:In the paper, we are concerned with some computational aspects of smooth approximation of da...
The consecutive numbering of the publications is determined by their chronological order. The aim of...
AbstractThe problem considered is that of finding a best uniform approximation to a real function f ...
Thesis (Ph.D.)--Boston UniversityPLEASE NOTE: Boston University Libraries did not receive an Authori...
In this paper we consider sequences of best approximation. We first examine the rho best approximati...
AbstractIn this paper an efficient method is presented for solving the problem of approximation of c...
In the paper, we are concerned with some computational aspects of smooth approximation of data. This...
This paper describes a fast and reliable algorithm which computes smooth piecewise polynomial approx...
BV functions cannot be approximated well by piecewise constant functions, but this work will show th...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
The methods discussed are based on local piecewise-linear secant approximations to continuous conve...
AbstractWe list and discuss published programs for best approximation of functions by linear and non...