THE CONVERGENCE ON A FAMILY OF ITERATIONS WITH CUBIC ORDER

1. IntroductionLet E and F be real or complex Banach spaces and f: D G E --+ F be a nonlinar twicediffereotiable operator. FOr solving the eqwtionconsider a one-parametered edly of iterationswhere Hj(x) = f'(x)--'f,,(x)j'(x)--'f(x) and 0 S A 5 1. This hal is cubically convergent(see [3, 7] ) and includes, as particular cases, Chebyshev method (^ = 0, see [5, 9l), Halleymethod (A = l, see [1, 4, 6, 10]) and suPer-Halley method (A = 1, see [7]).In [3], I.K. AIgyros et al analyze the con…     

关于不用计算导数的大范围收敛迭代法的注记

1　引　　言在文 [1 ]中我们借助于动力系统方法导出了求连续函数 ｆ(ｘ)在区间 [ａ ,ｂ]上单零点ｘ 的一个大范围收敛的连续性方法 .此处 ｆ(ｘ)满足李氏条件 ,且 ｆ(ａ) <0 ,ｆ(ｂ) >0 .这个连续性方法由动力系统ｄｘｄｔ =- ｆ(ｘ)ｘ( 0 ) =ｘ0 ∈ [ａ ,ｂ]( 1 )确定 ,其解析解ｘ(ｔ ,ｘ0 )具有性质ｌｉｍｔ→ +∞ｘ(ｔ,ｘ0 ) =ｘ ,　　ｘ0 ∈ [ａ ,ｂ].　　为了数值地求出ｘ ,我们利用显式欧拉法ｘｎ+ 1=ｘｎ -ｈｎｆ(ｘｎ)ｘ0 =ｂ　ｏｒａ ( 2 )来求 ( 1 )式的解 .其中ｈｎ>0 ,为步长 .它的选择满足文 [1 ]中的不等式ａ<ｘｎ+ 1<ｘｎ,…     

Banach空间中关于增生算子方程的迭代法的强收敛定理

设X是一实Banach空间,且T:X→X是Lipschitz连续的增生算子.在没有假设limn→∞αn=lim n→∞βn=0之下,本文证明了,Ishikawa迭代序列强收敛到方程x+Tx=f的唯一解,而且还对Ishikawa迭代序列提供了一般的收敛率估计.利用该结果,我们推得,当T:X→X是Lipschitz连续的强增生算子时, Ishikawa迭代序列强收敛到方程Tx=f的唯一解.     

ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.     

MBFGS算法中迭代矩阵的收敛性

Li-Fukushima[3]提出了一种修正的BFGS方法MBFGS算法.本文研究MBFGS算法中迭代矩阵的收敛性.我们证明在一定条件下,MBFGS算法用于求解严格凸二次函数极小值时产生的迭代矩阵序列是收敛的.     

预条件同时置换(PSD)迭代法的收敛性分析

1引言求解线性方程组Ax=6,(1.1)其中A∈R~(n×n)非奇异阵且对角元非零,x,b∈R~n,x未知,b已知.不失一般性,我们假设A=I-L-U,(1.2)其中L,U分别为A的严格下和上三角矩阵,相应的Jacobi迭代矩阵为B=L U.(1.3)若Q是非奇异阵且Q~(-1)易计算,于是(1.1)可以变成     

同时具有点和区间半径序列收敛性的免导迭代法的进一步讨论

1 引 言 传统的求零点的迭代法只讨论迭代序列{xn}的收敛阶,近年来,G.Alefeld和F.A.Po-tra研究了含零点的区间半径序列的收敛性[2][3],而我们提出了同时具有点和区间半径序列均平方收敛的免导迭代法[1],即当n充分大时,序列{xn}和含零点区间的半径序列{(bn-an)}都是平方收敛的.通过进一步的分析,我们发现,文[1]中的结果仍可改进,并且,不需     

ON THE CONVERGENCE OF THE PARABOLIC APPROXIMATION OF A CONSERVATION LAW IN SEVERAL SPACE DIMENSIONS

1.IntrodnctionWegiveaproofofthestrongconvergenceinofthesolutionoftheparabolicapproximationtowardstheentropicsolutiontothescalarconservationlawwhereuo(RN),udenotessomeapproximationofuosuchthatandthefluxfsatisfiesTheconvergenceoftheapproximatesolutions...     

离散空间分数阶非线性薛定谔方程的MHSS型迭代方法

利用隐式守恒型差分格式来离散空间分数阶非线性薛定谔方程,可得到一个离散线性方程组.该离散线性方程组的系数矩阵为一个纯虚数复标量矩阵、一个对角矩阵与一个对称Toeplitz矩阵之和.基于此,本文提出了用一种\textit{修正的埃尔米特和反埃尔米特分裂}(MHSS)型迭代方法来求解此离散线性方程组.理论分析表明,MHSS型迭代方法是无条件收敛的.数值实验也说明了该方法是可行且有效的.     

ON THE CONVERGENCE OF ASYNCHRONOUS NESTED MATRIX MULTISPLITTING METHODS FOR LINEAR SYSTEMS

1.IntroductionTherehasbeenalotofliterature(see[1]--[61and[12])ontheparalleliterativemethodsforthelarge--scalesystemoflinearequationsinthesenseofmatrixmultisplittingsincethepioneeringworkofO'LearyandWhite(see[l])waspublishedin1985.Oneofthemostrecentre...     

多孔介质中可压缩可混溶驱动问题的共轭梯度迭代法的L2模误差估计

2006年3月 高等学校计算数学学报 1数学模型 多孔介质中可压缩可混溶驱动问题的模型是两个非线性抛物型方程:压力方程和饱 和度方程.Douglass和Roberts曾提出其数学模型并研究了半离散化方法[“一”}.袁益让对 此模型研究了特征一有限元方法[s]和差分法10]. 本人对可压缩可混溶驱动问题的模型曾研究了共扼梯度迭代解与原问题真解的最优 阶H‘模误差估计阁.其中饱和度方程的弥散项为一甲·(D(劝甲c)，而本文讨论的是D(司 情况下的尸模误差估计.就护模而言，对此模型目前尚未有人讨论过.从本文可看到， 由于饱和度方程中含有拭c)鬓这一项，…     

THE CONVERGENCE OF DURAND-KERNER METHOD FOR SIMULTANEOUSLY FINDING ALL ZEROS OF THE POLYNOMIAL

1. IntroductionConsider a monic polynomial of degree nTo solve all zeros of this polynomial, the common--used is Durand--Kerner methodwhich has been considered simple and effective. For this reason) there are many works(Docev (1962), hemer (1966), Yamamoto (1990) and Zheng (1982)) to discuss theproperties of this method. In this paper, we propose the two kinds of criterion anduse them to judge the convergence of Durand-Kerner method or to compare with othermethods.Durand--Kerner method is …     

Banach空间中一类变分不等式的强收敛定理

应用广义投影算子引入了一类新的CQ迭代方法,并用此方法在Banach空间的非紧子集上证明了一个关于变分不等式的强收敛定理;这一定理所用的迭代方法不同于最近的一些相关定理,而且所得结论更加具体;最后,又用这一结果,考虑了在Banach空间,算子T的零点问题.     

ON AMODIFIED NEWTON''''S METHOD AND CONVERGENCE

In this paper we discuss the convergence of a modified Newton's method presented by A. Ostrowski [1] and J.F. Traub [2], which has quadratic convergence order but reduces one evaluation of the derivative at every two steps compared with Newton's method. A convergence theorem is established by using a weak condition a≤3-2(2~(1/2)) and a sharp error estimate is given about the iterative sequence.     

ON HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR CONTINUOUS SYLVESTER EQUATIONS

We present a Hermitian and skew-Hermitian splitting (HSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi-definite matrices. The unconditional convergence of the HSS iteration method is proved and an upper bound on the convergence rate is derived. Moreover, to reduce the computing cost, we establish an inexact variant of the HSS iteration method and analyze its convergence property in detail. Numerical results show that the HSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations.     

CONVERGENCE OF PARALLEL DIAGONAL ITERATION OF RUNGE-KUTTA METHODS FOR DELAY DIFFERENTIAL EQUATIONS

Implicit Runge-Kutta method is highly accurate and stable for stiff initial value prob-lem.But the iteration technique used to solve implicit Runge-Kutta method requires lotsof computational efforts.In this paper,we extend the Parallel Diagonal Iterated Runge-Kutta(PDIRK)methods to delay differential equations(DDEs).We give the convergenceregion of PDIRK methods,and analyze the speed of convergence in three parts for theP-stability region of the Runge-Kutta corrector method.Finally,we analysis the speed-upfactor through a numerical experiment.The results show that the PDIRK methods toDDEs are efficient.     

无限族严格渐近伪压缩映象隐迭代程序的强收敛定理

在Banach空间框架下,对无限族的严格渐近伪压缩映象和无限族的非扩张映象引入了一类新的隐迭代程序,并在适当的条件下,证明了该迭代程序强收敛于这两族映象的公共不动点.结果是新的,它推广和改进了一些人的最新结果.     

ON THE CONVERGENCE OF PARALLEL BFGS METHOD

ＯＮＴＨＥＣＯＮＶＥＲＧＥＮＣＥＯＦＰＡＲＡＬＬＥＬＢＦＧＳＭＥＴＨＯＤＣｈｅｎＺｈｏｎｇＦｅｉＰｕｓｈｅｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＷｕｈａｎＵｎｉｖｅｒｓｉｔｙ，Ｗｕｈａｎ４３００７２，Ｃｈｉｎａ．）ＺｈｏｕＹｕｎｃａｉ...     

ON THE OPTIMAL CONVERGENCE RATE OF A ROBIN-ROBIN DOMAIN DECOMPOSITION METHOD

In this work, we solve a long-standing open problem： Is it true that the convergence rate of the Lions＇ Robin-Robin nonoverlapping domain decomposition （DD） method can be constant, independent of the mesh size h？ We closed this old problem with a positive answer. Our theory is also verified by numerical tests.     

并行Halley迭代法的修正及其效率分析

In this paper a modification of the parallel Halley iteration method for simultaneously finding polynomial zeros is discussed. The convergence and the convergence rate with high order are obtained and the efficiency analysis is given.