Jerry M Wolfe

On the convergence of an algorithm for discreteLp approximation

SummaryThe convergence properties of an algorithm for discreteLp approximation (1≦p<2) that has been considered by several authors are studied. In particular, it is shown that for 1<p<2 the method converges (with a suitably close starting value) to the best approximation at a geometric rate with asymptotic convergence constant 2-p. A similar result holds forp=1 if the best approximation is unique. However, in this case the convergence constant depends on the function to be approximated.

Nonlinear L1 approximation of smooth functions

In this paper we shall consider certain aspects of nonlinear approximation of smooth functions in the L, norm on an interval [a, b] of the real line. In particular it will be shown that under certain circumstances (which would include many practical situations) second derivative techniques are applicable. This leads to checkable sufficient conditions for a local best approximation and makes applicable certain numerical techniques such as Newton’s method. We also consider the unicity problem and extend certain results in [l, 21 given for L, spaces with p > 2 to the setting of this paper. The approximation problem we consider is as follows. An open set S of Euclidean N-space EN is given and a map A(*): S + C]a, b] such that the map x + A”(x, ., .) is continuous on S where A”(x, -, .) is the second FrCchet derivative of the map A at the point X. Moreover we will assume that