Precise Rates in the Law of the Iterated Logarithm for the First Moment Convergence

In this paper, for the partial sums with their maximums of a sequence of i.i.d. random variables, we show the precise rates in the general law of the iterated logarithm of a kind of weighted infinite series of the first moment convergence by using the strong approximation and point out the equivalent moment conditions.     

Frames of Poisson wavelets on the sphere

In this paper we show that for sufficiently dense grids Poisson wavelets on the sphere constitute a weighted frame. In the proof we will only use the localization properties of the reproducing kernel and its gradient. This indicates how this kind of theorem can be generalized to more general reproducing kernel Hilbert spaces. With the developed technique we prove a sampling theorem for weighted Bergman spaces.     

Weighted generalization of the Ramadanov’S theorem and further considerations

We study the limit behavior of weighted Bergman kernels on a sequence of domains in a complex space ?^N, and show that under some conditions on domains and weights, weighed Bergman kernels converge uniformly on compact sets. Then we give a weighted generalization of the theorem given by M. Skwarczyński (1980), highlighting some special property of the domains, on which the weighted Bergman kernels converge uniformly. Moreover, we show that convergence of weighted Bergman kernels implies this property, which will give a characterization of the domains, for which the inverse of the Ramadanov’s theorem holds.     

求解非线性方程的加权迭代方法

提出加速迭代收敛的新思想,构造出一类加权迭代格式.通过选取最优加权因子使得该迭代格式具有较小的渐近误差常数,且至少具有原有迭代格式的收敛阶,数值例子表明该方法具有较快的收敛速度.     

A Jacobi-collocation method for solving second kind Fredholm integral equations with weakly singular kernels

In this work, we propose a Jacobi-collocation method to solve the second kind linear Fredholm integral equations with weakly singular kernels. Particularly, we consider the case when the underlying solutions are sufficiently smooth. In this case, the proposed method leads to a fully discrete linear system. We show that the fully discrete integral operator is stable in both infinite and weighted square norms. Furthermore, we establish that the approximate solution arrives at an optimal convergence order under the two norms. Finally, we give some numerical examples, which confirm the theoretical prediction of the exponential rate of convergence.     

独立随机序列加权和的强收敛性

本文研究独立随机变量序列加权和的强收敛性,利用截尾法和Borel-Cantelli引理,证明了加权系数ank为列阵情形的强收敛性,在一般双下标加权系数的加权部分和的强收敛性,并对Jamison型加权部分和情形证明了其强收敛的充要条件,推广了Chow与Teicher(1971)[3]的相应结果.     

phi�������������м�Ȩ�͵ľ���ȫ������

??In this paper, the complete moment convergence for weighted sums of-mixing random variable series are investigated. By using Rosenthal type inequality, we obtain complete moment convergence theorems for weighted sums of-mixing random variable series, which generalize and improve the corresponding results.     

The Durrmeyer type modification of the q-Baskakov type operators with two parameter α and β

In this paper, we are dealing with q analogue of Durrmeyer type modified the Baskakov operators with two parameter α and β, which introduces a new sequence of positive linear q-integral operators. We show that this sequence is an approximation process in the polynomial weighted space of continuous function defined on the interval [0, ∞). We study moments, weighted approximation properties, the rate of convergence using a weighted modulus of smoothness, asymptotic formula and better error estimation for these operators.     

Approximation by Kantorovich-Szász Type Operators Based on Brenke Type Polynomials

In this article, we give a generalization of the Kantorovich-Szász type operators defined by means of the Brenke type polynomials introduced in the literature and obtain convergence properties of these operators by using Korovkin’s theorem. Some graphical examples using the Maple program for this approximation are given. We also establish the order of convergence by using modulus of smoothness and Peetre’s K-functional and give a Voronoskaja type theorem. In addition, we deal with the convergence of these operators in a weighted space.     

关于序列的不等式及其应用

本文证明了一些关于新的序列的不等式.作为定理的应用,引进了一类新的迭 代序列并证明了它的收敛性.进一步地,证明了它与著名的Ishikawa迭代序列等价.     

Korovkin type approximation theorem via Ka−convergence on weighted spaces

In this paper, we study the Korovkin type approximation theorem for K_a‐ convergence, which is an interesting convergence method on weighted spaces. We also study the rate of K_a?convergence by using the weighted modulus of continuity and afterwards, we present a nontrivial application.     

Approximation properties of Szász‐Mirakyan‐Kantorovich type operators

In this paper, we introduce and study new type Szász‐Mirakyan‐Kantorovich operators using a technique different from classical one. This allow to analyze the mentioned operators in terms of exponential test functions instead of the usual polynomial type functions. As a first result, we prove Korovkin type approximation theorems through exponential weighted convergence. The rate of convergence of the operators is obtained for exponential weights.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

SOME RESEARCHES ON WEAK CONVERGENCE OF KERGIN INTERPOLATION

The aim of this paper is to study the weak integral convergence of Kergin interpolation. The results of the weighted integral convergence and the weighted （partial） derivatives integral convergence of Kergin interpolation polynomial for the smooth functions on the unit disk were obtained in the paper. Those generalized Liang＇s main results were acquired in 1998 to the more extensive situation. At the same time, the estimation of convergence rate of Kergin interpolation polynomial is given by means of introducing a new kind of smooth norm.     

Stancu Type Generalization of Dunkl Analogue of Szàsz Operators

In this paper, we introduce Stancu type generalization of Dunkl analogue of Szàsz operators. We obtain some direct results, which include asymptotic formula and error estimation in terms of of the modulus continuity. Also, we investigate the convergence of these operators in a weighted space and estimate the rate of convergence.     

High-order dual-parametric finite element methods for cavitation computation in nonlinear elasticity

In this paper, we present the numerical analysis on high order dual parametric finite element methods for the cavitation computation problems in nonlinear elasticity, which leads to a meshing strategy assuring high efficiency on numerical approximations to cavity deformations. Furthermore, to cope with the high order approximation of the finite element methods, properly chosen weighted Gaussian type numerical quadrature is applied to the singular part of the elastic energy. Our numerical experiments show that the high order dual parametric finite element methods work well when coupled with properly designed weighted Gaussian type numerical quadratures for the singular part of the elastic energy, and the convergence rates of the numerical cavity solutions are shown to be significantly improved as expected.     

On summability of weighted Lagrange interpolation. III

Starting from the Lagrange interpolation on the roots of Jacobi polynomials, a wide class of discrete linear processes is constructed using summations. Some special cases are also considered, such as the Fejér, de la Vallée Poussin, Cesàro, Riesz and Rogosinski summations. The aim of this note is to show that the sequences of this type of polynomials are uniformly convergent on the whole interval [-1,1] in suitable weighted spaces of continuous functions. Order of convergence will also be investigated. Some statements of this paper can be obtained as corollaries of our general results proved in [15].     

NOD随机变量随机加权部分和的完全收敛性

本文研究了NOD随机变量双下标随机加权部分和的完全收敛性,获得了一些完全矩收敛结果和完全收敛结果,从而获得了Marcinkiewicz-Zygmund型强大数律.我们的结果推广了目前已有的一些结论.进一步,我们给出一些数据模拟工作来展示收敛性结果.     

Error bounds of the Galerkin method for singular integral equations of the second kind

For solving singular integral equations of the first kind Erdogan proposed a method of Galerkin type, and convergence was proved by Linz. In this paper we consider equations of the second kind, and it is found that the method converges also in this case. However, stronger conditions than for the first kind equations must be imposed. The computational aspect of the convergence problem is also considered.