Weighted approximation by Bernstein quasiinterpolants for functions with singularities

We introduce a new type of modified Bernstein quasi-interpolants, which can be used to approximate functions with singularities. We establish direct, inverse, and equivalent theorems of the weighted approximation of this modified quasi-interpolants. Some classical results on approximation of continuous functions are generalized to the weighted approximation of functions with singularities.     

WEIGHTED APPROXIMATION ON SZASZ—TYPE OPERATORS

In this paper, we use weighted modules ω(?)(f,t)w to study the pointwise approximation on Szasz-type operators, and obtain the direct and converse theorem, as well as characterizations of the pointwise approximation of Jacobi-weighted Szasz-type operators.     

Weighted exponential polynomial approximation

A necessary and sufficient condition for completeness of systems of exponentials with a weight in Lp is established and a quantitative relation between the weight and the system of exponential in Lp is obtained by using a generalization of Malliavin's uniqueness theorem about Watson's problem.     

One-sided approximation of functions

The best one-sided approximation of periodic functions by trigonometric polynomials of classW _p ⁰ (K) in the metric ofL is obtained. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 136–140, January, 2000.     

Neural networks for of continuous optimal approximation functions in R^d

Using some regular matrices we present a method to express any multivariate algebraic polynomial of total order n in a normal form. Consequently, we prove constructively that, to approximate continuous target functions defined on some compact set of ? ^d , neural networks are at least as good as algebraic polynomials.     

Smooth approximation of definable continuous functions

Let be an -minimal expansion of the real exponential field which possesses smooth cell decomposition. We prove that for every definable open set, the definable indefinitely continuously differentiable functions are a dense subset of the definable continuous function with respect to the -minimal Whitney topology.

     

Weighted approximation of functions by Szász--Mirakyan-type operators

Summary We give error estimates for the weighted approximation of functions with singularities at the endpoints on the semiaxis by some modifications of Sz\'asz--Mirakyan operators. To do so, we define a new weighted modulus of smoothness and prove its equivalence to the weighted K-functional. Also, the class of functions for which the modified Sz\'asz--Mirakyan operator can be defined will be extended to a much wider set than for the original operator.     

Weighted approximation of continuous functions by sequences of linear positive operators

In this work we obtain, under suitable conditions, theorems of Korovkin type for spaces with different weight, composed of continuous functions defined on unbounded regions. These results can be seen as an extension of theorems by Gadjiev in [4] and [5].     

Nonlinear Chebyshev approximation to set-valued functions

In this paper, we give a characterization of best Chebyshev approximation to set-valued functions from a family of continuous functions with the weak betweeness property. As a consequence, we obtain a characterization of Kolmogorov type for best simultaneous approximation to an infinity set of functions. We introduce the concept of a set-sun and give a characterization of it. In addition, we prove a property of Amir–Ziegler type for a family of real functions and we get a characterization of best simultaneous approximation to two functions     

Smooth approximation of Lipschitz functions on Riemannian manifolds

We show that for every Lipschitz function f defined on a separable Riemannian manifold M (possibly of infinite dimension), for every continuous , and for every positive number r>0, there exists a C^∞ smooth Lipschitz function such that |f(p)−g(p)|?ε(p) for every p∈M and Lip(g)?Lip(f)+r. Consequently, every separable Riemannian manifold is uniformly bumpable. We also present some applications of this result, such as a general version for separable Riemannian manifolds of Deville-Godefroy-Zizler's smooth variational principle.     

Saddlepoint approximation for moments of random variables

In this paper, we introduce a saddlepoint approximation method for higher-order moments like E(S − a)₊ ^m , a>0, where the random variable S in these expectations could be a single random variable as well as the average or sum of some i.i.d random variables, and a > 0 is a constant. Numerical results are given to show the accuracy of this approximation method.     

Baskakov型算子加权逼近下的Stechkin-Marchaud不等式

本文利用K-泛函与光滑模的等价性,研究了Baskakov型算子加Jacobi权逼近下的Stechkin-Marchaud不等式,并得到了Baskakov型算子关于ω_φ²(f,t)_ω的逆结果.     

Some approximation methods for the distribution of random sums

This paper deals with approximation methods for the distribution of random sums, a subject being of high interest especially in actuarial mathematics (distribution of the total claim during a fixed time interval). Above all the authors intended to deliver rigid proofs for some propositions (such as Esscher and Edgeworth approximation) which are established in relevant articles frequently only in heuristic manner.     

Nonlinear approximation of functions based on nonnegative least squares solver

In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required parameters. The approximating function is linear in the first parameter; these parameters are assumed to be positive. The individual terms of the approximating function represent a fixed function that depends nonlinearly on the second parameter. A numerical approximation minimizes the residual functional by approximating function values at individual points. The second parameter's value is set on a more extensive set of points of the interval of permissible values. The proposed approach's key feature consists in determining the first parameter on each separate iteration of the classical nonnegative least squares method. The computational algorithm is used to rational approximate the function . The second example concerns the approximation of the stretching exponential function at $x\ge 0$ by the sum of exponents.     

Free transportation cost inequalities via random matrix approximation

By means of random matrix approximation procedure, we re-prove Biane and Voiculescus free analog of Talagrands transportation cost inequality for measures on R in a more general setup. Furthermore, we prove the free transportation cost inequality for measures on T as well by extending the method to special unitary random matrices.Supported in part by Grant-in-Aid for Scientific Research (C)14540198 and by the program R&D support scheme for funding selected IT proposals of the Ministry of Public Management, Home Affairs, Posts and Telecommunications.Supported in part by MTA-JSPS project (Quantum Probability and Information Theory) and by OTKA T032662.Supported in part by Grant-in-Aid for Young Scientists (B)14740118.Mathematics Subject Classification (2000): Primary: 46L54, 46L53; Secondary: 60F10, 15A52, 94A17.     

Banach空间上的随机加权和的收敛性

本文讨论了在P型和P凸Banach空间上的随机加权和un↑∑↑i=μnXni的r平均收敛性及依概率收敛性，并从给出了满足这些收敛性的充分与必要条件。在以往的文献中讨论的随机加权多为n↑∑↑i=1αniXi这种形式，而本文给出了在更一般情况下随机加权和的收敛性，并对以前的一些定理作了一些适当推广。