On the efficiency index of one-point iterative processes

In this paper, we analyze the index of efficiency of one-point iterative processes, which are in practice the most used methods to solve a nonlinear equation. We obtain the best situation for one-point iterative processes with cubic convergence: Chebyshev’s method, Halley’s method, the super-Halley method and many others classical iterative methods with order of convergence three. By means of a construction of particular multipoint iterations, we get to improve the best situation obtained for one-point methods. Moreover, these type of multipoint iterations, can be considered as quasi-one-point iterations, since they only depend on one initial approximation. Numerical examples are given and the computed results support this theory. Partly supported by the Ministry of Education and Science (MTM 2005-03091) and the University of La Rioja (ATUR-05/43).     

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.     

Mann-Type Steepest-Descent and Modified Hybrid Steepest-Descent Methods for Variational Inequalities in Banach Spaces

In this paper, we propose three different kinds of iteration schemes to compute the approximate solutions of variational inequalities in the setting of Banach spaces. First, we suggest Mann-type steepest-descent iterative algorithm, which is based on two well-known methods: Mann iterative method and steepest-descent method. Second, we introduce modified hybrid steepest-descent iterative algorithm. Third, we propose modified hybrid steepest-descent iterative algorithm by using the resolvent operator. For the first two cases, we prove the convergence of sequences generated by the proposed algorithms to a solution of a variational inequality in the setting of Banach spaces. For the third case, we prove the convergence of the iterative sequence generated by the proposed algorithm to a zero of an operator, which is also a solution of a variational inequality.     

一类求解单调变分不等式的隐式方法

1．引言变分不等式是一个非常有趣。非常困难的数学问题［"］．它具有广泛的应用（例如，数学规划中的许多基本问题都可以归结为一个变分不等式问题），因而得到深入的研究并有了不少算法［1，2，5－8，17－21］．对线性单调变分不等式，我们最近提出了一系列投影收缩算法Ig－13］．本文考虑求解单调变分不等式其中0CW是一闭凸集，F是从正p到自身的一个单调算子，一即有我们用比（·）表示到0上的投影．求解单调变分不等式的一个简单方法是基本投影法［1，6］，它的迭代式为然而，如果F不是仿射函数，只有当F一致强单调且LIPSChitZ连续…     

Consistency of iterative operator‐splitting methods: Theory and applications

In this article, we describe a different operator‐splitting method for decoupling complex equations with multidimensional and multiphysical processes for applications for porous media and phase‐transitions. We introduce different operator‐splitting methods with respect to their usability and applicability in computer codes. The error‐analysis for the iterative operator‐splitting methods is discussed. Numerical examples are presented. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

A modification of Cauchy's method for quadratic equations

The plan of this paper is to obtain one-point iterative methods with any R-order of convergence, when they are applied to approximate solutions of quadratic equations in Banach spaces. To do this, we consider real Cauchy's method and, under certain natural modifications, it is extended to Banach spaces. Some applications are also provided.     

求解热传导反问题的一种正则化Newton型迭代法

讨论热传导方程求解系数的一个反问题．把问题归结为一个非线性不适定的算子方程后,考虑该方程的Newton型迭代方法．对线性化后的Newton方程用隐式迭代法求解,关键的一步是引入了一种新的更合理的确定(内)迭代步数的后验准则．对新方法及对照的Tikhonov方法和Bakushiskii方法进行了数值实验,结果显示了新方法具有明显的优越性．     

Strong convergence of new iterative projection methods with regularization for solving monotone variational inequalities in Hilbert spaces

In this paper, we introduce two new numerical methods for solving a variational inequality problem involving a monotone and Lipschitz continuous operator in a Hilbert space. We describe how to incorporate a regularization term depending on a parameter in the projection method and then establish the strong convergence of the resulting iterative regularization projection methods. Unlike known hybrid methods, the strong convergence of the new methods comes from the regularization technique. The first method is designed to work in the case where the Lipschitz constant of cost operator is known, whereas the second one is more easily implemented without this requirement. The reason is because the second method has used a simple computable stepsize rule. The variable stepsizes are generated by the second method at each iteration and based on the previous iterates. These stepsizes are found with only one cheap computation without line-search procedure. Several numerical experiments are implemented to show the computational effectiveness of the new methods over existing methods.     

求解2—D波动方程系数反问题的迭代方法及收敛性

本文针对地震勘探中提出一类重要的２－Ｄ波动方程反演问题，通过定义一个新的非线性算子将２－Ｄ波动方程的反演问题归结为一个新的非线性算子方程，详细讨论了非线性算子的性质，给出了求解反问题的迭代方法，并证明了这种迭代方法的收敛性。     

An optimal Steffensen-type family for solving nonlinear equations

In this paper, a general family of Steffensen-type methods with optimal order of convergence for solving nonlinear equations is constructed by using Newton’s iteration for the direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub [H.T. Kung, J.F. Traub, Optimal order of one-point and multipoint iteration, J. Assoc. Comput. Math. 21 (1974) 634-651] that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2^m−1. Its error equations and asymptotic convergence constants are obtained. Finally, it is compared with the related methods for solving nonlinear equations in the numerical examples.     

On some families of multi-point iterative methods for solving nonlinear equations

Some semi-discrete analogous of well known one-point family of iterative methods for solving nonlinear scalar equations dependent on an arbitrary constant are proposed. The new families give multi-point iterative processes with the same or higher order of convergence. The convergence analysis and numerical examples are presented.     

Iterative operator‐splitting methods for nonlinear differential equations and applications

In this article, we consider iterative operator‐splitting methods for nonlinear differential equations with bounded and unbounded operators. The main feature of the proposed idea is the embedding of Newton's method for solving the split parts of the nonlinear equation at each step. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator‐splitting methods by providing improved results and convergence rates. We apply our results to deposition processes. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1026–1054, 2011     

Banach空间一类H-增生算子的混合拟变分包含的邻近算子方程

本文在Banach空间中引入一类H-增生算子的混合拟变分包含,并提出求该变分包含问题解的邻近点法.通过H-增生算子的预解算子技术,建立了混合拟变分包含问题与邻近算子方程的等价关系,由这个等价关系得到求解邻近算子方程的迭代算法,该算法收敛于上述混合拟变分包含问题的解.     

一类多值算子方程的迭代算法

本讨论Hilbert空间上具有强单调、上半Lipschitz连续性质的多值算子方程的求解方法,构造了迭代格式并证明迭代过程是收敛的;同时给出它在求解多值微分方程边值问题中的应用。     

解不适定算子方程的一个定常二步隐式迭代法

On the basis of an implicit iterative method for ill-posed operator equations,we introduce a relaxation factor and a weighted factor , and obtain a stationarytwo-step implicit iterative method. The range of the factors which guarantee theconvergence of iteration is explored.We also study the convergence properties and ratesfor both non-perturbed andperturbed equations.An implementable algorithm is presented by using Morozov discrepancy principle.The theoretical results show that the convergence rates of the new methods always lead to optimal convergentrates which are superior to those of the original one after choosing suitable relaxation and weightedfactors. Numerical examplesare also given, which coincide well with the theoretical results.     

Incomplete Semiiterative Methods for Solving Operator Equations in Banach Space

There are several methods for solving operator equations in a Banach space. The successive approximation methods require the spectral radius of the iterative operator be less that 1 for convergence. In this paper, we try to use the incomplete semiiterative methods to solve a linear operator equation in Banach space. Usually the special semiiterative methods are convergent even when the spectral radius of the iterative operator of an operator of an operator equation is greater than 1.     

求解第一类Fredholm积分方程的多层迭代算法

本文先把正则化后的第二类积分方程分解为等价的一对不含积分算子K^*K、仅含积分算子K以及K^*的方程组, 再用截断投影方法离散方程组, 采用多层迭代算法求解截断后的等价方程组, 并给出了后验参数的选择方法, 确保近似解达到最优.与传统全投影方法相比, 减少了积分计算的维数, 保持了最优收敛率. 最后, 算例说明了算法的有效性.     

基于正交多项式的解不适定算子方程的隐式迭代法

该文研究了基于Chebyshev和Jacobi多项式的解不适定算子方程的隐式迭代法.建立了隐式迭代法和由Hanke提出的显式迭代法之间的关系. 给出了与Chebyshev第一和第二多项式相关的迭代格式的残差有理式的一个重要引理. 对精确和扰动的数据, 研究了方程的收敛性和收敛速率. 利用Morozov残差原则, 给出了一个可执行的强健的正则化算法.最后还给出了一些数值例子, 数值结果与理论分析基本一致.     

Dynamical System Method for Solving Ill-Posed Operator Equations

Two dynamical system methods are studied for solving linear ill-posed problems with both operator and right-hand nonexact. The methods solve a Cauchy problem for a linear operator equation which possesses a global solution. The limit of the global solution at infinity solves the original linear equation. Moreover, we also present a convergent iterative process for solving the Cauchy problem.     

On new computational local orders of convergence

Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple precision and a stopping criteria are implemented without using any known root.