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.     

On integral bernstein operators in some classes of measurable bivariate functions

The two main theorems are concerned with the approximations of (complex-valued) functions on the real plane by sums of Bernstein pseudoentire functions. They are formulated and proved in Section 4, after prior determination of the suitable integral operators. Analogous results for pseudopolynomial approximations were obtained by Brudnyî, Gonska, and Jetter ([2],[3]).Research supported by KBN grant 2 1079 91 01.     

Statistical approximation theorems by k-positive linear operators

In this paper, using A-statistical convergence we obtain various approximation theorems by means of k-positive linear operators defined on the space of all analytic functions on the unit disk. Received: 17 February 2005     

Local approximation results for Szász-Mirakjan type operators

In this study, motivating our earlier work [O. Duman and M.A. ?zarslan, Szász-Mirakjan type operators providing a better error estimation. Appl. Math. Lett. 20, 1184–1188 (2007)], we investigate the local approximation properties of Szász-Mirakjan type operators. The second modulus of smoothness and Petree’s K-functional are considered in proving our results. Received: 17 September 2007     

On the stability of some classical operators from approximation theory

We obtain some results on Hyers–Ulam stability for some classical operators from approximation theory. For Bernstein operators we determine the Hyers–Ulam constant using a result concerning coefficient bounds of Lorentz representation for a polynomial.     

On best error bounds for approximation by piecewise polynomial functions

Summary An analog of the well-known Jackson-Bernstein-Zygmund theory on best approximation by trigonometric polynomials is developed for approximation methods which use piecewise polynomial functions. Interpolation and best approximation by polynomial splines, Hermite and finite element functions are examples of such methods. A direct theorem is proven for methods which are stable, quasi-linear and optimally accurate for sufficiently smooth functions. These assumptions are known to be satisfied in many cases of practical interest. Under a certain additional assumption, on the family of meshes, an inverse theorem is proven which shows that the direct theorem is sharp.The work presented in this paper was supported by the ERDA Mathematics and Computing Laboratory, Courant Institute of Mathematical Sciences, New York University, under Contract E(11-1)-3077 with the Energy Research and Development Administration.     

On orders of approximation of plane curves by parametric cubic splines

The aim of the present paper is to show that the convergence rate of the parametric cubic spline approximation of a plane curve is of order four instead of order three. For the first and second derivatives, the rates are of order three and two, respectively. Finally some numerical examples are given to illustrate the predicted error behaviour.     

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.     

Moduli of smoothness and approximation on the unit sphere and the unit ball

A new modulus of smoothness based on the Euler angles is introduced on the unit sphere and is shown to satisfy all the usual characteristic properties of moduli of smoothness, including direct and inverse theorem for the best approximation by polynomials and its equivalence to a K-functional, defined via partial derivatives in Euler angles. The set of results on the moduli on the sphere serves as a basis for defining new moduli of smoothness and their corresponding K-functionals on the unit ball, which are used to characterize the best approximation by polynomials on the ball.     

On the degree of approximation by spline functions with free knots

Summary A comparison theorem is derived for Chebyshev approximation by spline functions with free knots. This generalizes a result of Bernstein for approximation by polynomials.     

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.     

On the approximation power of bivariate splines

We show how to construct stable quasi-interpolation schemes in the bivariate spline spaces S _d ^r (Δ) with d⩾ 3r + 2 which achieve optimal approximation order. In addition to treating the usual max norm, we also give results in the L _p norms, and show that the methods also approximate derivatives to optimal order. We pay special attention to the approximation constants, and show that they depend only on the smallest angle in the underlying triangulation and the nature of the boundary of the domain. This revised version was published online in August 2006 with corrections to the Cover Date.     

Simultaneous approximation by Bernstein operators in Hölder norms

In this paper we discuss approximation of continuous functions f on [0, 1] in Hölder norms including simultaneous approximation of derivatives of f.     

Fully discrete approximation methods for the estimation of parabolic systems and boundary parameters

A spatially and temporally discrete numerical approximation scheme is developed for the identification of a class of semilinear parabolic systems with unknown boundary parameters. The identification problem is formulated as a least squares fit to data subject to an equivalent representation for the dynamics in the form of an abstract evolution equation. Finite-dimensional difference equation state approximations are constructed using a cubic spline-based, Galerkin method and the Padé rational function approximations to the exponential. A sequence of approximating identification problems result, the solutions of which are shown to exist and, in a certain sense, approximate solutions to the original identification problem. Numerical results for two examples, one involving the modeling of biological mixing in deep sea sediment cores, and the other, the estimation of transport parameters for indoor mixing, are discussed. In both examples, the identification is based upon actual experimental data.Parts of the research were carried out while the authors were visitors at the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, Virginia, which is operated under NASA Contracts No. NAS1-17070 and No. NAS1-17130.Research supported in part by NSF Grant MCS-8205355, AFOSR Contract 81-0198 and ARO Contract ARO-DAAG-29-K-0029.     

An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

On some new nonlinear discrete inequalities and their applications

In this paper, some new discrete inequalities in two independent variables which provide explicit bounds on unknown functions are established. The inequalities given here can be used as tools in the qualitative theory of certain finite difference equations.     

Discrete operators of sampling type and approximation in ‐variation

The paper deals with approximation results with respect to the φ‐variation by means of a family of discrete operators for φ‐absolutely continuous functions. In particular, for the considered family of operators and for the error of approximation, we first obtain some estimates which are important in order to prove the main result of convergence in φ‐variation. The problem of the rate of approximation is also studied. The discrete operators that we consider are deeply connected to some problems of linear prediction from samples in the past, and therefore have important applications in several fields, such as, for example, in speech processing. Moreover such family of operators coincides, in a particular case, with the generalized sampling‐type series on a subset of the space of the φ‐absolutely continuous functions: therefore we are able to obtain a result of convergence in variation also for the generalized sampling‐type series. Some examples are also discussed.     

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.