非线性方程组的具有单边初值条件的分裂型单调迭代数

本文利用区间迭代法的思想，提出一种使用单边初值条件的分裂型单调迭代方法，证明了该方法的收敛性，并且具体化到常见的单调迭代法。     

松弛型迭代法对单调映象收敛的充要条件

有各种迭代方法.松弛型迭代法、正则化迭代法、Ishikawa迭代法、预解式迭代法以及遍历型迭代法,最引人注目.这些迭代法的计算复杂性不尽相同,对不同单调程度的映象可分别使用.例如,松弛型迭代法     

高阶微分积分方程的单调迭代法及其应用

首先利用上下解方法以及微分不等式理论给出了n阶微分积分方程的初值问题解的存在性及其单调迭代法,然后将所得结果应用到n阶微分方程的两点边值问题,得到了n阶非线性两点边值问题解的存在性及其单调迭代法,所得结果推广了已有的结果．     

广义TOR方法及其收敛性

本文定义了广义的TOR迭代法,并且给出了广义TOR方法的Stein-Rosenberg型定理,讨论了广义TOR方法的单调收敛性.     

三阶非线性常微方程周期边值问题解的存在性

利用上下解方法和单调迭代法研究了一般形式的三阶常微分方程周期边值问题解的存在性．     

ATOR迭代法的收敛性

本文定义了广义ATOR迭代法,并给出了该方法的Stein-Rosenberg型定理和Ostrows-ki-Reich型定理,广义ATOR方法的单调收敛界及其与SOR法的比较也在本文给予讨论。     

一阶带参数的时滞微分方程的边值问题

本文利用上下解和单调迭代法，讨论了带参数的一阶时滞微分方程的边值问题，获得了这类问题极值解的存在性定理．     

单调迭代法与一阶脉冲泛函微分方程周期边值问题

本文利用单调迭代法与上下解方法,研究了一阶脉冲泛函做分方程周期边值问题最大解与最小解的存在性.     

求解非线性不适定问题的隐式迭代法

将处理线性不适定算子方程的隐式迭代法推广到非线性不适定问题,证明了迭代解误差序列的单调性,并进一步利用迭代误差的单调性得出求解非线性不适定问题隐式迭代法对精确方程和扰动方程的收敛性.     

解离散HJB方程的一个单调迭代法

本文对离散HJB方程提出一类新的迭代法,产生的迭代解单调收敛于HJB方程的解.此法的优点是简单易行.     

具有参数平方收敛的线性插值迭代类

提出了一类具有参数平方收敛的求解非线性方程的线性插值迭代法,方法以Newton法和Steffensen法为其特例,并且给出了该类方法的最佳迭代参数.数值试验表明,选用最佳迭代参数或其近似值的新方法比Newton法和Steffensen方法更有效.     

Modified families of multi-point iterative methods for solving nonlinear equations

We further present some semi-discrete modifications to the cubically convergent iterative methods derived by Kanwar and Tomar (Modified families of Newton, Halley and Chebyshev methods, Appl. Math. Comput. http://dx.doi.org/10.1016/j.amc.2007.02.119) and derived a number of interesting new classes of third-order multi-point iterative methods free from second derivatives. Furthermore, several functions have been tested and all the methods considered are found to be effective and compared to the well-known existing third and fourth-order multi-point iterative methods.      

A Family of Fifth-Order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.     

一种求解鞍点问题的广义对称超松弛迭代法

本文研究了鞍点问题的迭代算法.利用新的待定参数加速迭代格式并结合SSOR分裂的方法,获得了有两个参数的广义对称超松弛迭代法及其收敛性条件.数值例子表明选择适当的参数值可以提高算法的收敛效率,推广和改进了SOR-like迭代法.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

两类五阶解非线性方程组的迭代算法

本文首先根据Runge-Kutta方法的思想,结合Newton迭代法,提出了一类带参数的解非线性方程组F(x)=0的迭代算法,然后基于解非线性方程f(x)=0的King算法,给出第二类解非线性方程组的迭代算法,收敛性分析表明这两类算法都是五阶收敛的.其次给出了本文两类算法的效率指数,以及一些已知算法的效率指数,并且将本文算法的效率指数与其它方法进行详细的比较,通过效率比率R_(i,j)可知本文算法具有较高的计算效率.最后给出了四个数值实例,将本文两类算法与现有的几种算法进行比较,实验结果说明本文算法收敛速度快,迭代次数少,有明显的优势.     

关于鞍点问题的广义预处理HSS-SOR交替分裂迭代方法

本文研究了鞍点问题的迭代法. 在白中治,Golub和潘建瑜提出的预处理对称/反对称分裂（PHSS）迭代法的基础上,通过结合GSOR迭代格式,利用两个参数加速,提出了一种广义预处理HSS-SOR交替分裂迭代法,并研究了该方法的收敛性.数值结果表明本文所给方法是有效的.     

Solving non-differentiable equations by a new one-point iterative method with memory

We construct a new iterative method for approximating the solutions of nonlinear operator equations, where the operator involved is not differentiable. The algorithm proposed does not need to evaluate derivatives and is more efficient than the secant method. For this, we extend a result of Traub for one-point iterative methods to one-point iterative methods with memory.     

On convergence of iterative methods for maximal correlation problems

Several iterative methods for maximal correlation problems (MCPs) have been proposed in the literature. This paper deals with the convergence of these iterations and contains three contributions. Firstly, a unified and concise proof of the monotone convergence of these iterative methods is presented. Secondly, a starting point strategy is analysed. Thirdly, some error estimates are presented to test the quality of a computed solution. Both theoretical results and numerical tests suggest that combining with this starting point strategy these methods converge rapidly and are more likely converging to a global maximizer of MCP. Copyright © 2016 John Wiley & Sons, Ltd.     

On a Newton-Kurchatov-type Iterative Process

Newton's method and Kurchatov's method are iterative processes known for their fast speed of convergence. We construct from both methods an iterative method to approximate solutions of nonlinear equations given by a nondifferentiable operator, and we study its semilocal convergence in Banach spaces. Finally, we consider several applications of this new iterative process.