一种Gauss型求积公式的收敛性

构造一种有理插值型求积公式(RIQFs),并证明其收敛性.该方法是Gauss求积公式在有理函数空间(Γ)2n中的推广.     

On the order of convergence of Adomian method

In this paper, we contemplate the order of convergence of the Decomposition method, and we apply the results to some problems.     

On the convergence order of accelerated root iterations

Summary A Gauss-Seidel procedure for accelerating the convergence of the generalized method of the root iterations type of the (k+2)-th order (kN) for finding polynomial complex zeros, given in [7], is considered in this paper. It is shown that theR-order of convergence of the accelerated method is at leastk+1+ _n (k), where _n (k)>1 is the unique positive root of the equation ⁿ --k-1 = 0 andn is the degree of the polynomial. The examples of algebraic equations in ordinary and circular arithmetic are given.     

On the order conditions of fuzzy convergence classes

By means of the order structure of the related lattice, the LIMINF condition of fuzzy convergence classes is proposed in this paper, which reflects the essential difference between fuzzy convergence classes and ordinary convergence classes. The relationship between the LIMINF condition and two related conditions proposed by Liu and Wang respectively are discussed. The theory of fuzzy convergence classes based on LIMINF condition is established for topological molecular lattices, L-topological spaces (in the sense of Chang or Lowen), weakly induced spaces, and induced spaces.     

On spaces in which the norm convergence coincides with the order convergence

We investigate partially ordered normed vector spaces in which the norm convergence coincides with the order convergence. We consider spaces where the convergences coincide for arbitrary nets and spaces where the convergences coincide only for sequences. We give conditions which characterize such spaces and investigate their properties. In particular, we study the problem of their Dedekind completeness and -completeness.Translated from Matematicheskie Zametki, Vol. 13, No. 2, pp. 259–268, February, 1973.     

On the convergence of certain Gauss-type quadrature formulas for unbounded intervals

We consider the convergence of Gauss-type quadrature formulas for the integral , where is a weight function on the half line . The -point Gauss-type quadrature formulas are constructed such that they are exact in the set of Laurent polynomials }, where is a sequence of integers satisfying and . It is proved that under certain Carleman-type conditions for the weight and when or goes to , then convergence holds for all functions for which is integrable on . Some numerical experiments compare the convergence of these quadrature formulas with the convergence of the classical Gauss quadrature formulas for the half line.

     

On the restricted convergence of generalized extreme order statistics

Generalized order statistics (gos) introduced by Kamps [8] as a unified approach to several models of order random variables (rv’s), e.g., (ordinary) order statistics (oos), records, sequential order statistics (sos). In a wide subclass of gos, included oos and sos, the possible limit distribution functions (df’s) of the maximum gos are obtained in Nasri-Roudsari [10]. In this paper, for this subclass, as the df of the suitably normalized extreme gos converges on an interval [c, d] to one of possible limit df’s of the extreme gos, the continuation of this (weak) convergence on the whole real line to this limit df is proved.     

On exact order of convergence of random polynomials

Estimates for the rate of convergence of a random second-order polynomial to the distribution χ² in uniform and Lévy metrics are obtained. Also, the low bounds in these metrics are constructed. Proceedings of the Seminar on Stability Problems for Stochastic Models, Vologda, Russia, 1998, Part I.     

On the notion of stability of order convergence in vector lattices

In the theory of Banach lattices the following criterion for a norm to be order continuous is established: a norm is order continuous if and only if every order bounded sequence of positive pairwise disjoint elements in a lattice converges to zero in norm. In this paper we give a criterion for order convergence to be stable in a rather wide class of vector lattices which includes all Köthe spaces. The formulation of the criterion is analogous to that of the above-mentioned criterion for a norm to be order continuous. Namely, under certain conditions imposed on a vector lattice, stability of order convergence is equivalent to the condition that every order bounded sequence of positive pairwise disjoint elements converges relatively uniformly to zero. Furthermore, we study some types of order ideals in vector lattices. In terms of these ideals we give clarified versions of the above-stated criterions. As for notation and terminology, see for example [1,2].Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 35, No. 5, pp. 1026–1031, September–October, 1994.     

On the order of convergence of a semigroup to the identity operator

We describe classes of vectors f from a Hilbert space H for which the quantity ‖T(t)f?f‖, where T(t)=e ^?tA , t≥0, and A is a self-adjoint nonnegative operator in H, has a certain order of convergence to zero as t→+0.     

Real inversion formulas with rates of convergence

Some classical real inversion formulas, such as those concerning Fourier, Laplace and Stieltjes transforms, are unified in a way which allows us to give rates of convergence. As illustration, the case of the Fourier transform is considered. This revised version was published online in June 2006 with corrections to the Cover Date.     

On obtaining higher order convergence for smooth periodic functions

We present two algorithms for multivariate numerical integration of smooth periodic functions. The cubature rules on which these algorithms are based use fractional parts of multiples of irrationals in combination with certain weights. Previous work led to algorithms with quadratic and cubic error convergence. We generalize these algorithms so that one can use them to obtain general higher order error convergence. The algorithms are open in the sense that extra steps can easily be taken in order to improve the result. They are also linear in the number of steps and their memory cost is low.     

On the convergence of difference schemes for the diffusion equation of fractional order

For the diffusion equation of fractional order, we construct an approximation difference scheme of order 0(h ² + τ). We present an algorithm for the solution of boundary-value problems for a generalized transfer equation of fractional order. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 7, pp. 994–996, July, 1998.     

On the convergence of a fourth order evolution equation to the Allen-Cahn equation

We construct special sequences of solutions to a fourth order nonlinear parabolic equation of Cahn-Hilliard/Allen-Cahn type, converging to the second order Allen-Cahn equation. We consider the evolution equation without boundary, as well as the stationary case on domains with Dirichlet boundary conditions. The proofs exploit the equivalence of the fourth order equation with a system of two second order elliptic equations with “good signs”.     

On the convergence of solutions of certain systems of second order differential equations

Summary The object of this paper is to furnish an n-dimensional analogue of a convergence result obtained in [3] by Loud for the equation (1.4).     

First order convergence of matroids

The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini–Schramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling. We establish the matroid counterpart of this result: every first order convergent sequence of matroids with bounded branch-depth representable over a fixed finite field has a limit modeling, i.e., there exists an infinite matroid with the elements forming a probability space that has asymptotically the same first order properties. We show that neither of the bounded branch-depth assumption nor the representability assumption can be removed.