Lower bound for the convergence rate of nonstationary Jacobi-like iteration

Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A.     

The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudocontractive mappings without Lipschitzian assumption

In this paper we prove some new equivalences between convergence of the Ishikawa and Mann iteration sequences with errors in two schemes by Xu [Y.G. Xu, Ishikawa and Mann iteration process with errors for nonlinear strongly accretive operator equations, J. Math. Anal. Appl. 224 (1998) 91-101] and Liu [L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194 (1995) 114-125], respectively, for strongly successively pseudocontractive mappings. Our main results improve and extend the corresponding results of the all references listed in this article.     

Nonparametric estimation and adaptive control in a class of finite Markov decision chains

We consider a class of Markov decision processes withfinite state and action spaces which, essentially, is determined by the following condition: The state space isirreducible under the action of any stationary policy. However, except by this restriction, the transition law iscompletely unknown to the controller. In this context, we find a set of policies under which thefrequency estimators of the transition law are strongly consistent and then, this result is applied to constructadaptive asymptotically discount-optimal policies.Dedicated to Professor Truman O. Lewis, on the occasion of his sixtieth birthdayThis research was supported in part by the Third World Academy of Sciences (TWAS) under Grant TWAS RG MP 898-152, and in part by the Consejo Nacional de Ciencia y Tecnología (CONACYT) under Grant A128CCOEO550 (MT-2).     

A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems

Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing costs. Numerical example is given to demonstrate the validity of the present algorithm. The project supported by the Machinary and Electronics Ministry of China     

带耗散的一阶非线性偏微分方程组的Cauchy问题

本文采用整体迭代法证明了带小初值的一阶非线性耗散偏微分方程组的Cauchy问题的整体经典解的存在性及指数衰减性质。     

迭代的计算与估计

对高次多项式函数这类非线性映射给出了一般 n次迭代的一个计算结果 ,还讨论了一维欧氏空间中一些非多项式型映射的迭代 .在二维欧氏空间中 ,我们给出了几类特殊的非线性迭代的结果 .对于一些难以精确计算迭代表达式的映射 ,我们给出了其迭代的估计 .     

解强刚性块线代数方程组的两类L-收敛迭代法

对解强刚性块线代数方程组X=(A(?)J)X φ,本文提出了L-收敛的最佳单参数迭代法(L-OOPI)和L-收敛的多参数迭代直接法(L-MPID),并给出了数值例子．数例表明,对于强刚性块线代数方程组,该二迭代法是有效的．     

Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.     

Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy.     

A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extersion of a known theorem in the corresponding non-random case.