Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Approximation of functions, extremal problems in function classes

From Encyclopedia of Mathematics - Reading time: 12 min


Problems connected with the search for upper bounds of approximation errors with respect to a fixed class of functions and with the choice of an approximation tool that is best in some sense or other. The foundations of the research concerning this kind of problems were laid by A.N. Kolmogorov ([1], [2]), J. Favard ([3], ) and S.M. Nikol'skii ([5], [6]). These researches were greatly extended in the 1950s. They stimulated the requirements of numerical mathematics, penetrating ever deeper into problems of an optimization character.

If in a normed function space X one considers the approximation of functions from a class M by functions from a fixed set NX, then problems on determining the quantity

(1)E(M, N)X = supfM E(f, N)X,

where

E(f, N)X = infϕN fϕX

is the best approximation of a function f(t) by N, as well as on determining the quantity

(2)E(M, N, U)X = supfM fUfX,

where U is a specific approximation method, given by some operator acting from X into N, are of interest. Geometrically, the supremum in (1) characterizes the deviation of the set M from N in the metric of X. In practice, E(M, N)X can be looked upon, first, as the minimal-possible bound from above for the best approximation of N by functions that are only known to belong to M, and secondly, it gives a tool for measuring and comparing the approximative properties of concrete approximation methods on M. In (2), the most important case is when N=NN is an N- dimensional space and U is a linear approximation method. A whole series of exact and asymptotically-exact results is known for the approximation of function classes by concrete linear methods (in particular, by polynomial or spline methods), see [1][12], . However, special interest attaches to methods attaining the infimum

(3)E(M, NN)X = infUXNN E(M, NN, U)X,

over all linear bounded operators U from X into NX, i.e. to all linear methods that are optimal for M. Obviously,

E(M, NN)X  E(M, NN)X,

and there naturally arises the question on whether the equality sign can be attained. Apart from the trivial case when X is a Hilbert function space and the best approximation of a function is given by its Fourier sums with respect to an orthogonal basis of NX, some results when linear methods realize the best approximation on the entire class M are also known for non-Hilbert spaces.

Thus, if X is the space L~=L~p[0, 2π]( 1p) of 2π- periodic functions, N2n1T is the subspace of trigonometric polynomials of order n1( dim N2n1T=2n1), and if MW~pr, r=1, 2 is the class of functions fL~p for which f (r1)(t) is absolutely continuous on [0, 2π] and for which f (r)L~pM, then

E(MW~pr, N2n1T)L~p = E(MW~pr, N2n1T)L~p = MKrnr,

p = 1, ;  n, r = 1, 2

where Kr is the Favard constant. The best approximation on MW~1r and MW~r is obtained, moreover, by a linear method Un1λ, constructed on the basis of Fourier sums (cf. Approximation of functions, linear methods, formula (3)) for a specific choice of the multiplication coefficients λk(n1)=λk(n1)(r). Linear operators, with values in N2n1T, yielding the supremum of the best approximation on convolution classes, including, in particular, MW~r and MW~1r with a rational number r>0, as well as on classes of conjugate functions, have been established (cf. [10], [11]).

For approximation by the subspace S2πm of 2π- periodic splines of order m and defect 1 with knots (nodes, joints) at kπ/n( dim S2nm=2n), the equalities

E(MW~pr, S2nr1)L~p = E(MW~pr, S2nr1)L~p = MKrnr,

p = 1, ;  n, r = 1, 2

are valid. The splines σr1(f, t) in S2πr1 interpolating a function f at kπ/n if r is even, and at (2k+1)π/2n if r is odd, provide the best linear methods in this case. Relative to MW~r these splines have exceptional approximative properties, since they give the best approximation of an fMW~r in any L~p( cf. [7], [15]).

When (1) and (3) coincide and when it is possible to construct a concrete linear method solving both problems, the cases considered are, in a well-known sense, optimal. In other cases it proved expedient in solving (1) to adopt an approach based on general duality theorems, reflecting fundamental relations in geometric convex analysis (see [7], [8]). If, e.g. X is an arbitrary linear normed space, X is its dual and N is a convex set in X, then for any xX

(4)infuN xu = supFX,F1 [F(x)supuN F(u)];

in particular, if N is a subspace,

(5)infuN xu = sup {F(x):FX, F1,F(u)=0  for   all  uN}.

In a number of cases (4), or (5), allows one to reduce the calculation of the supremum (1) to the more transparent problem of determining the extremum of an explicitly defined functional on some set of functions, which, if N is a subspace, is related to orthogonality conditions. For example, by (5) the estimation of E(W~qr, N2n1T)L~p, 1p, q, can be reduced, using known inequalities, to the calculation of the supremum of the norms gq, q=q/(q1), on the set of functions gWpr, p=p/(p1), for which

02πg(t) cossin ktkt dt = 0,  k=0n1.

More refined situations occur when (1) has to be solved on classes not given by restrictions on the norm of the r- th derivative f (r)(t), but on its modulus of continuity ω(f (r), δ)X. Particularly interesting is the case where M=W~rHω( r=0, 1,; W~0Hω=H~ω) is the class of 2π- periodic functions fC~r( C~0=C~) for which

ω(f (r), δ)C = ω(f (r), δ)  ω(δ),

where ω(δ) is a given modulus of continuity, e.g. ω(δ)=Mδα( 0<α1, 0δπ). Here the application of (5) requires the use of fine results on differentiable periodic functions of the type of the comparison theorem and the Kolmogorov inequality (for the norm of derivatives), here described using the tool of rearrangements (of equi-measurable functions). If ω(δ) is convex from above, the following equalities ([7], [15]) are valid:

E(W~rHω, N2n1T)X = E(W~rHω, S2nr)X = fnr(ω)X,

n = 1, 2,;  r = 0, 1,.

Here X=C~ or L~1, the fnr(ω, t) are functions in W~rHω of period 2π/n, with zero average over a period, for which fnr (r) is even, equal to [ω(π/n2t)]/2 on [0, π/2n], and equal to [ω(2tπ/n)]/2 on [π/2n, π/n]. The norms fnr(ω)X have an explicit expression, e.g.

fn0(ω)C~ = 12ω(πn),

fnr(ω)C~ = 12nr0πΦr(πt)ω(tn) dt,  r=1, 2

where the functions Φk(t) on [0, π] are given recurrently by

Φ1(t) = 12,  Φk(t) = 120πtΦk1(u) du.

The best linear method from C~ into N2n1T, or into S2nr, for the class W~Hω is known for ω(δ)=mδ, 0δπ, i.e. when W~rHω=MW~r+1. The interpolation splines σr(f, t) in S2πr yield the supremum E(W~rHω, S2πr)C~( for any convex ω(δ)) only if r=1.

For solutions to extremal problems for function classes on a finite interval and not restricted by rigid boundary conditions, it is not possible to give such complete results as in the periodic case; the extremal end points of the interval have a perturbing influence on the extremal functions, which require an increase in the order of differentiability. Here, some exact asymptotic results are known. If MWrHα, r=0, 1 0<α<1, MW0Hα=MHα, is the class of functions fCr[1, 1] for which

|f (r)(t)f (r)(t)|  M |tt|α  (t, t[1, 1]),

then for the best uniform approximation on [1, 1] by the subspace NnA of algebraic polynomials of degree n1, the relations

(6)limn nαE(MHα, NnA)C = Mπα2,

(7)limn nr+αE(MWrHα, NnA)C = M20πΦr(πt)tα dt,

r = 1, 2

hold. It is useful to compare these results with the corresponding ones in the periodic case. For α=1, the right-hand sides of (6), (7) are equal, respectively, to MK1 and MKr+1. Dropping the requirement of a polynomial of best approximation, one obtains stronger results, essentially improving the approximation at the end points of [1, 1] without losing the best asymptotics on the whole interval. E.g., for any fMHα there is a sequence of algebraic polynomials pn(f, t)NnA such that uniformly in t[1, 1], as n, one has

|f(t)pn(f, t)|  M2[(πn1t2)α+o(nα)] =

= E(MHα, NnA)C[(1t2)α/2+o(1)].

Analogous results hold for MWrH1, r=1, 2 see [11]. In spline-approximation problems (both of best and of interpolation type) certain exact and asymptotically-exact results are known for function classes on intervals (cf. [15]).

In the case of one-sided approximation (in an integral metric) a series of exact results concerning the estimation of the error of best approximation by polynomials and splines regarding the above-mentioned function classes is known (cf. [14]). In deriving them, essential use is made of duality relations for the best approximation under restrictions given by cones.

The search for a best approximation tool (of fixed dimension), leads, for a fixed function class M, to the problem of widths: Determine (cf. (1), (3)):

dN(M, X) = infNN E(M, NN)X,

dN (M, X) = infNN E(M, NN)X,

where the infima are taken over all subspaces NN of X( as well as over their translations) of dimension N, and also to determine extremal (best) subspaces yielding these infima. An upper bound for dN and dN  is given by E(M, N)X and E(M, NN)X, which have been established for concrete subspaces NN. The fundamental difficulty in the problem of widths, here, is to obtain exact lower bounds. In a number of cases it is possible to obtain such bounds by appealing to topological considerations, in particular, Borsuk's antipodal theorem (cf. [8]). In practically all cases of exactly solving best approximation problems in the classes MW~pr and W~rHω of periodic functions by the subspaces N2n1T( trigonometric polynomials of order n1) or S2nm( splines of order m and defect 1 with respect to the partition of knots kπ/n), the known exact upper bounds E(M, NN)X give also the values of dN for these classes. Moreover, for periodic classes d2n1=d2n. In particular (cf. [7], [8], [15], )

d2n1(W~r, C~) = d2n(W~r, C~) = d2n1(W~1r, L~1) =

= d2n(W~1r, L~1) = Krnr,  n, r=1, 2

and for an upper convex ω(δ) and for X=C~ or L~1 one has

d2n1(W~rHω, X) = d2n(W~rHω, X) = fnr(ω)X,

n=1, 2, . . .;  r=0, 1, . . ..

It should be observed that N2n1T is extremal for the classes considered, for all r, and that no subspace of dimension 2n gives a better approximation for these classes than N2n1T( which is of dimension 2n1). The subspace S2nm of splines is extremal for W~r+1 and W~rHω in C~ if m=r and for W~pr+1 in L~1 if mr. The linear widths dN  of W~r in C~ and W~1r in L~1 coincide with dN, they are attained on N2n1T and S2nr1 by the best linear methods that were referred to above. The widths dN and dN  of W~2r in L~2 for N=2n1 and N=2n are equal and are obtained by Fourier trigonometric sums. Exact asymptotic results for widths of function classes on an interval are known in a number of cases: The widths dN and dN  of Wr in C[1, 1] coincide and are obtained for interpolation splines of order r1 with respect to non-uniform partitions (cf. [8]).

The problem of estimating the approximation error on the set Xr of r- fold integrals of functions from X( which is not locally compact) can be stated properly if for fXr and fixed γ>0 one estimates

E(f, NN)Xω(f (r), γ)X

( ω(g, δ)X is the modulus of continuity of g in X) or (in the case of a concrete approximation method) if one estimates

fUNfXω(f (r), γ)X.

Determining the suprema of these quantities on Xr is equivalent to the search for the least constant in the corresponding Jackson inequality; subsequently one may deal with the minimization over all subspaces of dimension N. In a number of cases, these problems have been solved. E.g. in the inequality

E(f, S2nr)C~  Mrnrω(f (r), πn)C~,  fC~r,

the least constant is Mr=Kr/2, and it cannot be improved if S2nr is replaced by any other subspace of the same dimension (cf. [15]). Exact constants in the Jackson inequalities for trigonometric approximation in the uniform and in an integral metric are known (cf. [7]). In the non-periodic case there are asymptotic results available.

Among approximation problems in which the approximating set is not a linear manifold but a convex set, the problem of approximating one function class M by another M1 with best, in some sense or other, smoothness properties, is of interest. Such a problem arose initially at an intermediate stage in obtaining exact bounds for

E(H~ω, N2n1T)C~  (M = H~ω,  M1 = MW~1)

(cf. [7]); later it became to be considered as an independent problem, and in a number of cases it was possible, using (4), to obtain exact results.

For

M = M1Wpr,

M1 = M2Wqk  (0<r<k)

relations have been obtained between inequalities for norms of derivatives and best approximations of a differentiation operator by linear bounded operators (cf. [13]).

Many extremal problems in the approximation of functions may be interpreted as problems of optimal recovery (cf. [15]). Let the information on a function fX be given by a vector T(f, Λ)={λ1(f)λn(f)}, where λk are given functionals on X( e.g. values of f and/or some derivatives in fixed points). Given that f belongs to a class M, it is required to reconstruct f or some linear functional L(f) of it (e.g. L(f)=f(t), L(t)=abf(t) dt, etc.) on the basis of T(f, Λ) with least possible error. The minimization need not only take into account methods S juxtaposing T(f, Λ) with a function ϕ(t)f(t)( or a functional l(f)L(f)), but also involves the choice of functionals λk, k=1N. Depending on the choice of the error measure and the class of methods S, the problem of optimal recovery of a function may sometimes be reduced to determining the widths dN, dN , the Chebyshev centre, or other characteristics of M. The problem of optimal recovery of abf(t) dt on the basis of information of the form {f(tk)} or {f (ν)(tk)} leads to the problem of best quadrature formulas for M. The best tool of recovering is achieved, in a number of cases, by splines; e.g. the splines σr1(f, t) in S2nr1 that interpolate at equally-distant points tk reconstruct an fW~r on the basis of information λk(f)=f(tk) in each point ttk with minimum error on the whole class W~r.

In spaces of functions of two or more variables, excluding the trivial case of approximation in Hilbert spaces, exact solutions of extremal problems have not yet been obtained (1983). In a few cases an asymptotic relation for the error of uniform approximation in function classes by Fourier sums or some average Fourier sums is known (cf. [12]).

References[edit]

[1] A.N. Kolmogorov, Ann. of Math. , 36 : 2 (1935) pp. 521–526
[2] A.N. [A.N. Kolmogorov] Kolmogoroff, "Ueber die beste Annäherung von Funktionen einer gegebenen Funktionenklasse" Ann. of Math. , 37 : 1 (1936) pp. 107–110
[3] J. Favard, C.R. Acad. Sci. , 203 (1936) pp. 1122–1124
[4a] J. Favard, "Sur les meilleurs procédés d'approximation de certaines classes de fonctions par des polynômes trigonométriques" Bull. Sci. Math. , 61 (1937) pp. 209–224
[4b] J. Favard, "Sur les meilleurs procédés d'approximation de certaines classes de fonctions par des polynômes trigonométriques" Bull. Sci. Math. , 61 (1937) pp. 243–256
[5] S.M. Nikol'skii, "Approximations of periodic functions by trigonometric polynomials" Trudy Mat. Inst. Steklov. , 15 (1945) pp. 1–76 (In Russian) (English abstract)
[6] S.M. Nikol'skii, "Mean approximation of functions by trigonometric polynomials" Izv. Akad. Nauk SSSR Ser. Mat. , 10 (1946) pp. 207–256 (In Russian)
[7] N.P. Korneichuk, "Extremal problems in approximation theory" , Moscow (1976) (In Russian)
[8] V.M. Tikhomirov, "Some problems in approximation theory" , Moscow (1976) (In Russian)
[9] V.K. Dzyadyk, "Introduction to the theory of uniform approximation of functions by polynomials" , Moscow (1977) (In Russian)
[10] N.I. [N.I. Akhiezer] Achiezer, "Theory of approximation" , F. Ungar (1956) (Translated from Russian)
[11] A.F. Timan, "Theory of approximation of functions of a real variable" , Pergamon (1963) (Translated from Russian)
[12] A.I. Stepanets, "Uniform approximation by trigonometric polynomials. Linear methods" , Kiev (1984) (In Russian)
[13] V.V. Arestov, "Some extremal problems for differentiable functions of one variable" Trudy Mat. Inst. Steklov. , 138 (1975) pp. 3–28 (In Russian)
[14] N.P. Korneichuk, A.A. Ligun, V.G. Doronin, "Approximation with constraints" , Kiev (1982) (In Russian)
[15] N.P. Korneichuk, "Splines in approximation theory" , Moscow (1984) (In Russian)

Comments[edit]

The recent book by A. Pinkus [a1] contains a comprehensive and valuable bibliography.

References[edit]

[a1] A. Pinkus, "n-widths in approximation theory" , Springer (1985) (Translated from Russian)
[a2] C.A. Michelli, T.J. Rivlin, "A survey of optimal recovery" C.A. Michelli (ed.) T.J. Rivlin (ed.) , Optimal estimation in approximation theory , Plenum (1977) pp. 1–54

How to Cite This Entry: Approximation of functions, extremal problems in function classes (Encyclopedia of Mathematics) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Approximation_of_functions,_extremal_problems_in_function_classes
1 |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF