Some notes on split Newton iterative algorithm

In this study, a parameterized split Newton method is derived by using the accelerating technique. Convergence and error estimates of the method are obtained. In practical application, the proposed method can give a better result in view of computational CPU time. Numerical examples on several partial differential equations are shown to illustrate our findings. Copyright © 2015 John Wiley & Sons, Ltd.     

求解广义鞍点问题的一个新的类SOR算法

本文提出了求解广义鞍点问题的一个新的类SOR迭代算法,并分析了新算法的收敛性.数值实验结果表明新算法是十分有效的.     

离散DGM(1,1,t~α)模型

针对具有部分指数特征且含时间幂次项的数据序列,分别建立了以x~0(1)和x~1(n)为初始条件的离散DGM(1,1,t~α)模型,并给出了α取1,2时的模型公式及其推导过程;根据数据序列的最小二乘曲线并不一定就是由初始值迭代拟合生成的曲线,对DGM(1,1,t~α)模型的迭代基值进行了优化,并给出了基值修正项的估计式;最后,通过一个实例验证了所建模型的合理性与实用性.     

Coincidences of Nonself Operators by a Simpler Algorithm

Abstract

In this article, we introduce a new class of contractive mappings and study analytical and computational aspects of a special case of Jungck-Khan iterative algorithm generated by this class of mappings. In particular, we improve upon strong convergence, rate of convergence and data dependence results existing in the current literature. Analytical as well numerical illustrative examples are given to support the new results.     

非线性绝对值方程组的类SOR迭代方法

提出了非线性绝对值方程组(AVE)问题解的存在性和唯一性的一个充分条件,构建了数值求解方程组的类超松弛迭代方法,并证明其收敛性.数值算例表明该迭代方法是非常有效的.     

A nearly optimal preconditioning based on recursive red–black orderings

Considering matrices obtained by the application of a five-point stencil on a 2D rectangular grid, we analyse a preconditioning method introduced by Axelsson and Eijkhout, and by Brand and Heinemann. In this method, one performs a (modified) incomplete factorization with respect to a so-called ‘repeated’ or ‘recursive’ red–black ordering of the unknowns while fill-in is accepted provided that the red unknowns in a same level remain uncoupled. Considering discrete second order elliptic PDEs with isotropic coefficients, we show that the condition number is bounded by 𝒪(n ${}^{\text{½ log}{}_{\text{2}}\text{(√(5) −1)}}$ ) where n is the total number of unknowns (½ log₂(√(5) − 1) = 0.153), and thus, that the total arithmetic work for the solution is bounded by 𝒪(n^1.077). Our condition number estimate, which turns out to be better than standard 𝒪(log² n) estimates for any realistic problem size, is purely algebraic and holds in the presence of Neumann boundary conditions and/or discontinuities in the PDE coefficients. Numerical tests are reported, displaying the efficiency of the method and the relevance of our analysis. © 1997 John Wiley & Sons, Ltd.     

一致凸Banach空间非扩张映象带误差的Ishikawa型的三重迭代序列的收敛性

在一致凸Banach空间上,研究了半紧的非扩张压缩映象‖Tx-Ty‖≤‖x-y‖的Ishikawa型的三重迭代序列的收敛性问题,建立并证明了带误差的Ishikawa三重迭代逼近收敛定理,从而独特的推广了Mann和Ishikawa迭代方法,改进和发展了文献[1]-[7]的主要结果.     

线性互补问题的异步并行多分裂松弛迭代算法

将求解线性方程组的异步并行多分裂松弛迭代算法推广到线性互补问题.当问题的系数矩阵为H-矩阵类时,证明了算法的全局收敛性.     

矩阵方程X-A~*X~qA=Q(q>0)的Hermite正定解

本文讨论了矩阵方程X-A*XqA=Q(q>0)的Hermite正定解,给出了q>1时解存在的必要条件,存在区间,以及迭代求解的方法．证明了0相似文献   

矩阵多分裂迭代法的收敛条件

本文给出了求解非奇异线性方程组的矩阵多分裂并行迭代法的一些新的收敛结果.当系数矩阵单调和多分裂序列为弱正则分裂时,得到了几个与已有的收敛准则等价的条件,并且证明了异步迭代法在较弱条件下的收敛性.对于同步迭代,给出了与异步迭代不同且较为宽松的收敛条件.