Generalized Hermite-Padé approximation for Nikishin systems of three functions

Nikishin systems of three functions are considered. For such systems, the rate of convergence of simultaneous interpolating rational approximations with partially prescribed poles is studied. The solution is described in terms of the solution of a vector equilibrium problem in the presence of a vector external field.     

On the bivariate Shepard-Lidstone operators

We propose a new combination of the bivariate Shepard operators (Coman and Trîmbi?a?, 2001 [2]) by the three point Lidstone polynomials introduced in Costabile and Dell’Accio (2005) [7]. The new combination inherits both degree of exactness and Lidstone interpolation conditions at each node, which characterize the interpolation polynomial. These new operators find application to the scattered data interpolation problem when supplementary second order derivative data are given (Kraaijpoel and van Leeuwen, 2010 [13]). Numerical comparison with other well known combinations is presented.     

A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback’s quasi-interpolation scheme.     

Some variants of Ostrowski's method with seventh-order convergence

In this paper, we present a class of new variants of Ostrowski's method with order of convergence seven. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative and therefore this class of methods has the efficiency index equal to 1.627. Numerical tests verifying the theory are given, and multistep iterations, based on the present methods, are developed.     

Kolmogorov diameters of entire functions of given growth

The paper establishes the decrease rate of the Kolmogorov diameters of entire functions from the space L ²(0, ∞) in terms of minimal Blaschke products on the singularity sets of Borel transforms. Besides, in C(K) the decrease rate of the Kolmogorov diameters is calculated for entire functions with given finite order.     

Minimally supported error representations and approximation by the constants

Summary. Distribution theory is used to construct minimally supported Peano kernel type representations for linear functionals such as the error in multivariate Hermite interpolation. The simplest case is that of representing the error in approximation to f by the constant polynomial f(a) in terms of integrals of the first order derivatives of f. This is discussed in detail. Here it is shown that suprisingly there exist many representations which are not minimally supported, and involve the integration of first order derivatives over multidimensional regions. The distance of smooth functions from the constants in the uniform norm is estimated using our representations for the error. Received June 30, 1997 / Revised version received April 6, 1999 / Published online February 17, 2000     

Approximation by boolean sums of positive linear operators III: Estimates for some numerical approximation schemes

In the present note we intröduce and investigate certain sequences of discrete positive linear operators and Boolean sum modifications of them. The mappings considered are obtained by discretizing a class of transformed convolution-type operators using Gaussian quadrature of appropriate order. For our operators and their modifications we prove pointwise Jackson-type theorems involving the first and second order moduli of smoothness, thus providing new and elegant proofs of earlier results by Timan, Telyakowskii, Gopengauz and DeVore. Due to their discrete structure, optimal order of approximation and ease of computation, the operators appear to be useful for numerical approximation. In an intermediate step we solve an old problem in Approximation Theory; its importance was only recently emphasized in a paper of Butzer.     

Integral error formulæ for the scale of mean value interpolations which includes Kergin and Hakopian interpolation

Summary. In this paper, we provide an integral error formula for a certain scale of mean value interpolations which includes the multivariate polynomial interpolation schemes of Kergin and Hakopian. This formula involves only derivatives of order one higher than the degree of the interpolating polynomial space, and from it we can obtain sharp -estimates. These -estimates are precisely those that numerical analysts want, to guarantee that a scheme based on such an interpolation has the maximum possible order. Received July 11, 1994 / Revised version received February 12, 1996     

Smooth PONS

PONS^tm is a basis which satisfies all of the fundamental properties of the Walsh functions (each element is piecewise constant, takes on only the values ±1, and can be efficiently computed via a fast transform) plus three additional properties that are false for the Walsh functions: PONS is optimal with respect to a global uncertainty principle; all PONS elements have uniformly bounded crest factors; and all PONS elements are QMF’s. In 1991, Ingrid Daubechies asked whether there exists a smooth basis satisfying the global uncertainty principle property. In this article we show how to transform any basis into another basis by applying the PONS construction, thereby providing an affirmative answer to this question.     

On the convergence of hybrid polynomial approximation to higher derivatives of rational curves

In this paper, we derive the bounds on the magnitude of l  th (l=2,3)$(l=2,3)$ order derivatives of rational Bézier curves, estimate the error, in the _L∞$L_{\infty }$ norm sense, for the hybrid polynomial approximation of the l  th (l=1,2,3)$(l=1,2,3)$ order derivatives of rational Bézier curves. We then prove that when the hybrid polynomial approximation converges to a given rational Bézier curve, the l  th (l=1,2,3)$(l=1,2,3)$ derivatives of the hybrid polynomial approximation curve also uniformly converge to the corresponding derivatives of the rational curve. These results are useful for designing simpler algorithms for computing tangent vector, curvature vector and torsion vector of rational Bézier curves.     

Saturation of Kantorovich type operators

It is proved that an integrable functionf can be approximated by the Kantorovich type modification of the Szász—Mirakjan and Baskakov operators inL ¹ metric in the optimal order {n ^–1} if and only if ² f is of bounded variation where and , respectively.     

Constrained variational refinement

A non-uniform, variational refinement scheme is presented for computing piecewise linear curves that minimize a certain discrete energy functional subject to convex constraints on the error from interpolation. Optimality conditions are derived for both the fixed and free-knot problems. These conditions are expressed in terms of jumps in certain (discrete) derivatives. A computational algorithm is given that applies to constraints whose boundaries are either piecewise linear or spherical. The results are applied to closed periodic curves, open curves with various boundary conditions, and (approximate) Hermite interpolation.     

Convex polynomial and spline approximation inL p,O<p<∞

We prove that a convex functionf ∈ L _p[−1, 1], 0<p<∞, can be approximated by convex polynomials with an error not exceeding Cω ₃ ^ϕ (f,1/n)_p where ω ₃ ^ϕ (f,·) is the Ditzian-Totik modulus of smoothness of order three off. We are thus filling the gap between previously known estimates involving ω ₃ ^ϕ (f,1/n)_p, and the impossibility of having such estimates involving ω₄. We also give similar estimates for the approximation off by convexC ⁰ andC ¹ piecewise quadratics as well as convexC ² piecewise cubic polynomials. Communicated by Dietrich Braess     

A nodal spline interpolant for the Gregory rule of even order

Summary The Gregory rule is a well-known example in numerical quadrature of a trapezoidal rule with endpoint corrections of a given order. In the literature, the methods of constructing the Gregory rule have, in contrast to Newton-Cotes quadrature,not been based on the integration of an interpolant. In this paper, after first characterizing an even-order Gregory interpolant by means of a generalized Lagrange interpolation operator, we proceed to explicitly construct such an interpolant by employing results from nodal spline interpolation, as established in recent work by the author and C.H. Rohwer. Nonoptimal order error estimates for the Gregory rule of even order are then easily obtained.     

Approximation of monomials by lower degree polynomials

Our topic is the uniform approximation ofx ^k by polynomials of degreen (n on the interval [–1, 1]. Our major result indicates that good approximation is possible whenk is much smaller thann ² and not possible otherwise. Indeed, we show that the approximation error is of the exact order of magnitude of a quantity,p _k,n , which can be identified with a certain probability. The numberp _k,n is in fact the probability that when a (fair) coin is tossedk times the magnitude of the difference between the number of heads and the number of tails exceedsn.     

A family of stable nonlinear nonseparable multiresolution schemes in 2D

Multiresolution representations of data are powerful tools in data compression. For a proper adaptation to the edges, a good strategy is to consider a nonlinear approach. Thus, one needs to control the stability of these representations. In this paper, 2D multiresolution processing algorithms that ensure this stability are introduced. A prescribed accuracy is ensured by these strategies.     

Asymptotic approximation by de la Vallée Poussin means and their derivatives

The concern of this paper is the study of local approximation properties of the de la Vallée Poussin means V_n. We derive the complete asymptotic expansion of the operators V_n and their derivatives as n tends to infinity. It turns out that the appropriate representation is a series of reciprocal factorials. All coefficients are calculated explicitly.     

Error estimates of quasi-interpolation and its derivatives

Quasi-interpolation of radial basis functions on finite grids is a very useful strategy in approximation theory and its applications. A notable strongpoint of the strategy is to obtain directly the approximants without the need to solve any linear system of equations. For radial basis functions with Gaussian kernel, there have been more studies on the interpolation and quasi-interpolation on infinite grids. This paper investigates the approximation by quasi-interpolation operators with Gaussian kernel on the compact interval. The approximation errors for two classes of function with compact support sets are estimated. Furthermore, the approximation errors of derivatives of the approximants to the corresponding derivatives of the approximated functions are estimated. Finally, the numerical experiments are presented to confirm the accuracy of the approximations.     

On a Sequence of Positive Linear Operators Associated with a Continuous Selection of Borel Measures

In this paper we introduce and study a new sequence of positive linear operators acting on the space of Lebesgue-integrable functions on the unit interval. These operators are defined by means of continuous selections of Borel measures and generalize the Kantorovich operators. We investigate their approximation properties by presenting several estimates of the rate of convergence by means of suitable moduli of smoothness. Some shape preserving properties are also shown. Dedicated to the memory of Professor Aldo Cossu