Asymptotic Behaviour of Best lp-Approximations from Affi ne Subspaces

In this paper we consider the problem of best approximation in ℓ_pⁿ, 1<p∞. If h_p, 1<p<∞, denotes the best ℓ_p-approximation of the element h ⁿ from a proper affine subspace K of ⁿ, hK, then lim_p→∞h_p=h_∞^*, where h_∞^* is a best uniform approximation of h from K, the so-called strict uniform approximation. Our aim is to prove that for all r there are α_j ⁿ, 1jr, such that

Full-size image

, with γ_p^{(r) n} and γ_p^(r)= (p^−r−1).     

Bivariate spline interpolation with optimal approximation order

Let Δ be a triangulation of some polygonal domain Ω ⊂ R² and let S_q^r(Δ) denote the space of all bivariate polynomial splines of smoothness r and degree q with respect to Δ. We develop the first Hermite-type interpolation scheme for S _q ^r (Δ), q ≥ 3r + 2, whose approximation error is bounded above by Kh ^q +1, where h is the maximal diameter of the triangles in Δ, and the constant K only depends on the smallest angle of the triangulation and is independent of near-degenerate edges and near-singular vertices. Moreover, the fundamental functions of our scheme are minimally supported and form a locally linearly independent basis for a superspline subspace of S _q ^r (Δ). This shows that the optimal approximation order can be achieved by using minimally supported splines. Our method of proof is completely different from the quasi-interpolation techniques for the study of the approximation power of bivariate splines developed in [7] and [18].     

Three-Convex Approximation by Free Knot Splines in C [0, 1]

A Jackson-type estimate is obtained for the approximation of 3 -convex functions by 3 -convex splines with free knots. The order of approximation is the same as for the Jackson-type estimate for unconstrained approximation by splines with free knots. Shape-preserving free knot spline approximation of k -convex functions, k > 3 , is also considered. January 15, 1996. Date revised: December 9, 1996.     

Constrained Lp-Approximation by Generalized n-Convex Functions Induced by ECT-Systems

The problem of finding a best L_p-approximation (1 ≤ p < ∞) to a function in L_p from a special subcone of generalized n-convex functions induced by an ECT-system is considered. Tchebycheff splines with a countably infinite number of knots are introduced and best approximations are characterized in terms of local best approximations by these splines. Various properties of best approximations and their uniqueness in L₁ are investigated. Some special results for generalized monotone and convex cases are obtained.     

W(R)-splines

In [3] Golomb describes, for 1 < p < ∞, the H^r,p(R)-extremal extension F_* of a function ƒ:E → R (i.e., the H^r,p-spline with knots in E) and studies the cone H_*E^r,p of all such splines. We study the problem of determining when F_* is in W^r,p ≡ H^r,p ∩ L^p. If F_* ε W^r,p, then F_* is called a W^r,p-spline, and we denote by W_*E^r,p the cone of all such splines. If E is quasiuniform, then F_* ε W^r,p if and only if {ƒ(t_i)}_tiεE ε l^p. The cone W_*E^r,p with E quasiuniform is shown to be homeomorphic to l^p. Similarly, H_*E^r,p is homeomorphic to h^r,p. Approximation properties of the W^r,p-splines are studied and error bounds in terms of the mesh size ¦ E ¦ are calculated. Restricting ourselves to the case p = 2 and to quasiuniform partitions E, the second integral relation is proved and better error bounds in terms of ¦ E ¦ are derived.     

BestL 1-approximations of classesW 1 r by Splines fromW 1 r

We obtain the exact values of the bestL ₁-approximations of the classesW ₁ ^r of periodic functions by periodic polynomial splines of degreer and defect 1 with equidistant knots that belong to the classW ₁ ^r .Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 10, pp. 1410–1413, October, 1994.     

Approximation properties of λ‐Bernstein‐Kantorovich operators with shifted knots

In the present article, Kantorovich variant of λ‐Bernstein operators with shifted knots are introduced. The advantage of using shifted knot is that one can do approximation on [0,1] as well as on its subinterval. In addition, it adds flexibility to operators for approximation. Some basic results for approximation as well as rate of convergence of the introduced operators are established. The r^th order generalization of the operator is also discussed. Further for comparisons, some graphics and error estimation tables are presented using MATLAB.     

Convergence of Derivatives of Optimal Nodal Splines

Optimal nodal spline interpolantsWfof ordermwhich have local support can be used to interpolate a continuous functionfat a set of mesh points. These splines belong to a spline space with simple knots at the mesh points as well as atm−2 arbitrary points between any two mesh points and they reproduce polynomials of orderm. It has been shown that, for a sequence of locally uniform meshes, these splines converge uniformly for anyfCas the mesh norm tends to zero. In this paper, we derive a set of sufficient conditions on the sequence of meshes for the uniform convergence ofD^jWftoD^jfforfC^sandj=1, …, s<m. In addition we give a bound forD^rWfwiths<r<m. Finally, we use optimal nodal spline interpolants for the numerical evaluation of Cauchy principal value integrals.     

On approximation of functions from below by splines of the best approximation with free nodes

Let M be the set of functions integrable to the power β=(r+1+1/p)^-1. We obtain asymptotically exact lower bounds for the approximation of individual functions from the set M by splines of the best approximation of degree rand defect k in the metric of L _p.     

On the relationship between functions with the same optimal knots in spline and piecewise polynomial approximation

The relationship between functions with the same optimal knots for L₂[0, 1] approximation by kth order splines or piecewise polynomials is investigated. It is shown that if two functions have positive continuous kth derivatives they will have the same optimal knots if and only if they differ by a polynomial of order k. An application to design selection for continuous time regression is considered and extensions to L_p approximation are also provided.     

Free-knot spline approximation of stochastic processes

We study optimal approximation of stochastic processes by polynomial splines with free knots. The number of free knots is either a priori fixed or may depend on the particular trajectory. For the s-fold integrated Wiener process as well as for scalar diffusion processes we determine the asymptotic behavior of the average L_p-distance to the splines spaces, as the (expected) number of free knots tends to infinity.     

Three-monotone spline approximation

For r≥3, n∈N and each 3-monotone continuous function f on [a,b] (i.e., f is such that its third divided differences [x₀,x₁,x₂,x₃]f are nonnegative for all choices of distinct points x₀,…,x₃ in [a,b]), we construct a spline s of degree r and of minimal defect (i.e., s∈C^r−1[a,b]) with n−1 equidistant knots in (a,b), which is also 3-monotone and satisfies ‖f−s‖_L∞[a,b]≤cω₄(f,n⁻¹,[a,b])_∞, where ω₄(f,t,[a,b])_∞ is the (usual) fourth modulus of smoothness of f in the uniform norm. This answers in the affirmative the question raised in [8, Remark 3], which was the only remaining unproved Jackson-type estimate for uniform 3-monotone approximation by piecewise polynomial functions (ppfs) with uniformly spaced fixed knots.Moreover, we also prove a similar estimate in terms of the Ditzian–Totik fourth modulus of smoothness for splines with Chebyshev knots, and show that these estimates are no longer valid in the case of 3-monotone spline approximation in the L_p norm with p<∞. At the same time, positive results in the L_p case with p<∞ are still valid if one allows the knots of the approximating ppf to depend on f while still being controlled.These results confirm that 3-monotone approximation is the transition case between monotone and convex approximation (where most of the results are “positive”) and k-monotone approximation with k≥4 (where just about everything is “negative”).     

The order of the best one-sided approximation by polynomials and splines in the Lp-metric

In this paper we determine the order of the best one-sided approximation by polynomials and splines of minimal defect of the classes W^rL_p in the L_p-metric.Translated from Matematicheskie Zametki, Vol. 19, No. 3, pp. 323–329, March, 1976.     

Symptotic behavior of the best uniform approximations of individual functions by splines

It is established that in the class W^rH, where (t) is a convex modulus of continuity, that there exists a function for which the error of the best approximation by splines of minimal deficiency (including ones with free nodes) asymptotically coincides with the upper bound of approximation of the functions of class W^rH by these same splines.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 1, pp. 59–64, January, 1980.     

Asymptotic expansions in the conditional central limit theorem

Let X_n, n , be i.i.d. with mean 0, variance 1, and E(¦X_n¦^r) < ∞ for some r 3. Assume that Cramér's condition is fulfilled. We prove that the conditional probabilities P(1/√n Σ_{i = 1}ⁿ X_i t¦B) can be approximated by a modified Edgeworth expansion up to order o(1/n^{(r − 2)/2)}), if the distances of the set B from the σ-fields σ(X₁, …, X_n) are of order O(1/n^{(r − 2)/2)}(lg n)^β), where β < −(r − 2)/2 for r and β < −r/2 for r . An example shows that if we replace β < −(r − 2)/2 by β = −(r − 2)/2 for r (β < −r/2 by β = −r/2 for r ) we can only obtain the approximation order O(1/n^{(r − 2)/2)}) for r (O(lg lgn/n^{(r − 2)/2)}) for r ).     

Average CaseL∞-Approximation in the Presence of Gaussian Noise

We consider the average caseL_∞-approximation of functions fromC^r([0, 1]) with respect to ther-fold Wiener measure. An approximation is based onnfunction evaluations in the presence of Gaussian noise with varianceσ²>0. We show that the n th minimal average error is of ordern^{−(2r+1)/(4r+4)} ln^1/2 n, and that it can be attained either by the piecewise polynomial approximation using repetitive observations, or by the smoothing spline approximation using non-repetitive observations. This completes the already known results forL_q-approximation withq<∞ andσ0, and forL_∞-approximation withσ=0.     

О наилучшем выборе уз лов при интерполиров ании функций эрмитовыми с плайнами

The problem of optimal choice of knots is considered for the functions belonging to the classW ^2m+1 V, concerning interpolation by means of Hermite splines. The problem of asymptotically best choice of the knots for interpolation of a fixed functionf(x) (f^(2m+2)(x)>0, 0x1) by Hermite splines is also treated.     

Gibbs-Wilbraham splines

If a function with a jump discontinuity is approximated in the norm ofL ²[–1,1] by a periodic spline of orderk with equidistant knots, a behavior analogous to the Gibbs-Wilbraham phenomenon for Fourier series occurs. A set of cardinal splines which play the role of the sine integral function of the classical phenomenon is introduced. It is then shown that ask becomes large, the phenomenon for splines approaches the classical phenomenon.Communicated by Ronald A. DeVore.     

Stable Local Bases for Multivariate Spline Spaces

We present an algorithm for constructing stable local bases for the spaces ^r_d(Δ) of multivariate polynomial splines of smoothness r1 and degree dr2ⁿ+1 on an arbitrary triangulation Δ of a bounded polyhedral domain Ω ⁿ, n2.