Equivalence theorems of the convergence between Ishikawa and Mann iterations with errors for generalized strongly successively Φ-pseudocontractive mappings without Lipschitzian assumptions

In this paper, the equivalence of the strong convergence between the modified Mann and Ishikawa iterations with errors in two different 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 is proven for the generalized strongly successively Φ-pseudocontractive mappings without Lipschitzian assumption. Our results generalize the recent results of the papers [Zhenyu Huang, F. Bu, The equivalence between the convergence of Ishikawa and Mann iterations with errors for strongly successively pseudocontractive mappings without Lipschitzian assumption, J. Math. Anal. Appl. 325 (1) (2007) 586-594; B.E. Rhoades, S.M. Soltuz, The equivalence between the convergences of Ishikawa and Mann iterations for an asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive maps, J. Math. Anal. Appl. 289 (2004) 266-278; B.E. Rhoades, S.M. Soltuz, The equivalence between Mann-Ishikawa iterations and multi-step iteration, Nonlinear Anal. 58 (2004) 219-228] by extending to the most general class of the generalized strongly successively Φ-pseudocontractive mappings and hence improve the corresponding results of all the references given in this paper by providing the equivalence of convergence between all of these iteration schemes for any initial points u₁, x₁ in uniformly smooth Banach spaces.     

Inexact inverse subspace iteration for generalized eigenvalue problems

n this paper, we present an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax=λBx. We first formulate a version of inexact inverse subspace iteration in which the approximation from one step is used as an initial approximation for the next step. We then analyze the convergence property, which relates the accuracy in the inner iteration to the convergence rate of the outer iteration. In particular, the linear convergence property of the inverse subspace iteration is preserved. Numerical examples are given to demonstrate the theoretical results.     

A modified fixed-point iterative algorithm for image restoration using fourth-order PDE model

In this paper, we propose a modified fixed point iterative algorithm to solve the fourth-order PDE model for image restoration problem. Compared with the standard fixed point algorithm, the proposed algorithm needn?t to compute inverse matrices so that it can speed up the convergence and reduce the roundoff error. Furthermore, we prove the convergence of the proposed algorithm and give some experimental results to illustrate its effectiveness by comparing with the standard fixed point algorithm, the time marching algorithm and the split Bregman algorithm.     

Convergence theorems for λ-strict pseudo-contractions in q-uniformly smooth Banach spaces

In this paper, we continue to discuss the properties of iterates generated by a strict pseudo- contraction or a finite family of strict pseudo-contractions in a real q-uniformly smooth Banach space. The results presented in this paper are interesting extensions and improvements upon those known ones of Marino and Xu [Marino, G., Xu, H. K.： Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl., 324, 336-349 （2007）]. In order to get a strong convergence theorem, we modify the normal Mann＇s iterative algorithm by using a suitable convex combination of a fixed vector and a sequence in C. This result extends a recent result of Kim and Xu [Kim, T. H., Xu, H. K.： Strong convergence of modified Mann iterations. Nonl. Anal., 61, 51- 60 （2005）] both from nonexpansive mappings to λ-strict pseudo-contractions and from Hilbert spaces to q-uniformly smooth Banach spaces.     

渐近非扩张映象的修正的Ishikawa迭代程序

本文研究一致凸Banach空间中关于渐近非扩张映象不动点的修正的Ishikawa迭代程序的强收敛性，本文结果统一，推广与改进了目前文献中的一些最新结果。     

Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method

We establish a general convergence theory of the Shift-Invert Residual Arnoldi(SIRA)method for computing a simple eigenvalue nearest to a given targetσand the associated eigenvector.In SIRA,a subspace expansion vector at each step is obtained by solving a certain inner linear system.We prove that the inexact SIRA method mimics the exact SIRA well,i.e.,the former uses almost the same outer iterations to achieve the convergence as the latter does if all the inner linear systems are iteratively solved with low or modest accuracy during outer iterations.Based on the theory,we design practical stopping criteria for inner solves.Our analysis is on one step expansion of subspace and the approach applies to the Jacobi-Davidson(JD)method with the fixed targetσas well,and a similar general convergence theory is obtained for it.Numerical experiments confirm our theory and demonstrate that the inexact SIRA and JD are similarly effective and are considerably superior to the inexact SIA.     

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.     

A new modified one-step smoothing Newton method for solving the general mixed complementarity problem

In last decades, there has been much effort on the solution and the analysis of the mixed complementarity problem (MCP) by reformulating MCP as an unconstrained minimization involving an MCP function. In this paper, we propose a new modified one-step smoothing Newton method for solving general (not necessarily P₀) mixed complementarity problems based on well-known Chen-Harker-Kanzow-Smale smooth function. Under suitable assumptions, global convergence and locally superlinear convergence of the algorithm are established.     

MODIFIED NEWTON＇S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

Newton＇s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton＇s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.     

On the equivalence of the convergence criteria between modified Mann–Ishikawa and multi-step iterations with errors for successively strongly pseudo-contractive operators

In this paper, the equivalence of the convergence between the modified Mann–Ishikawa and multi-step Noor iterations with errors is proven for the successively strongly pseudo-contractive operators without Lipschitzian assumption. Our results generalize the recent results of the paper [B.E. Rhoades, S.M. Soltuz, The equivalence between Mann–Ishikawa iterations and multi-step iteration, Nonlinear Anal. 58 (2004) 219–228; B.E. Rhoades, S.M. Soltuz, The equivalence between the convergences of Ishikawa and Mann iterations for an asymptotically nonexpansive in the intermediate sense and strongly successively pseudo-contractive maps, J. Math. Anal. Appl. 289 (2004) 266–278] by extending to the more generalized multi-step iterations with errors and hence improve the corresponding results of all the references in bibliography by providing the equivalences of convergence between all of these up-to-date iteration schemes.     

On Convergence Domains of Newton's and Modified Newton Methods

ABSTRACT

We analyze convergence domains of Newton's and the modified Newton methods for solving operator equations in Banach spaces assuming first that the operator in question is ω-smooth in a ball centered at the starting point. It is shown that the gap between convergence domains of these two methods cannot be closed under ω-smoothness. Its exact size for Hölder smooth operators is computed. Then we proceed to investigate their convergence domains under regular smoothness. As our analysis reveals, both domains are the same and wider than their counterparts in the previous case.     

A MODIFIED GAUSS-SEIDEL ITERATION FOR LINEAR INTERVAL EQUATIONS

In order to solve linear interval equations Ax=b. the interval Gauss-Seidel iteration is applied to a modified equations A'x = b', where A' is obtained by eliminating all elements in the first upper codiagonal part of A. It is shown that this modified Gauss-Seidel iteration converges when the usual Gauss-Seidel iteration converges, and the modified Gauss-Seidel iteration always has a smaller convergence factor. The converse is not true. It is also pointed out that the modified Gauss-Seidel iteration can obtain a belter result comparing with the usual Gauss-Seidel iteration in some cases. Several examples confirmed these conclusions.     

Asymptotic error estimates for the method of simple iteration and for the modified and generalized Newton methods

We find asymptotic error estimates for the method of simple iteration and for the modified and generalized Newton methods. The results, in contrast with the classical ones, provide explicit error estimates for these iterative processes in terms of their parameters, and this plays a decisive role not only for the proof of the convergence of combined methods, but also for determining the order of convergence. Moreover, in practice this allows us to theoretically evaluate the number of iterations sufficient for constructing the combined method of maximal order, and therefore to find the optimal number of iterations.Translated fromMatematicheskie Zametki, Vol. 63, No. 4, pp. 562–571, April, 1998.     

Modified block iterative algorithm for Quasi-?-asymptotically nonexpansive mappings and equilibrium problem in banach spaces

The purpose of this paper is to propose a modified block iterative algorithm for find a common element of the set of common fixed points of an infinite family of quasi-?-asymptotically nonexpansive mappings and the set of an equilibrium problem. Under suitable conditions, some strong convergence theorems are established in a uniformly smooth and strictly convex Banach space with the Kadec-Klee property. As an application, at the end of the paper a numerical example is given. The results presented in the paper improve and extend the corresponding results in Qin et al. [Convergence theorems of common elements for equilibrium problems and fixed point problem in Banach spaces, J. Comput. Appl. Math., 225, 2009, 20-30], Zhou et al. [Convergence theorems of a modified hybrid algorithm for a family of quasi-?-asymptotically nonexpansive mappings, J. Appl. Math. Compt., 17 March, 2009, doi:10.1007/s12190-009-0263-4], Takahashi and Zembayshi [Strong and weak convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces, Nonlinear Anal., 70, 2009, 45-57], Wattanawitoon and Kumam [Strong convergence theorems by a new hybrid projection algorithm for fixed point problem and equilibrium problems of two relatively quasi-nonexpansive mappings, Nonlinear Anal. Hybrid Syst., 3, 2009, 11-20] and Matsushita and Takahashi [A strong convergence theorem for relatively nonexpansive mappings in Banach spaces, J. Approx. Theory, 134, 2005, 257-266] and others.     

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.     

A Modified Landweber Iteration for Solving Parameter Estimation Problems

In this paper a convergence analysis for a modified Landweber iteration for the solution of nonlinear ill-posed problems is presented. A priori and a posteriori stopping criteria for terminating the iteration are compared. Some numerical results for the solution of a parameter estimation problem are presented. Accepted 11 September 1996     

On interpolation variants of Newton’s method for functions of several variables

A generalization of the variants of Newton’s method based on interpolation rules of quadrature is obtained, in order to solve systems of nonlinear equations. Under certain conditions, convergence order is proved to be 2d+1, where d is the order of the partial derivatives needed to be zero in the solution. Moreover, different numerical tests confirm the theoretical results and allow us to compare these variants with Newton’s classical method, whose convergence order is d+1 under the same conditions.     

Ideas from Continued Fraction Theory Extended to Padé Approximation and Generalized Iteration

This is a survey of some basic ideas in the convergence theory for continued fractions, in particular value sets, general convergence and the use of modified approximants to obtain convergence acceleration and analytic continuation. The purpose is to show how these ideas apply to some other areas of mathematics. In particular, we introduce {w _k }-modifications and general convergence for sequences of Padé approximants.     

The generalization of Meyer-König and Zeller operators by generating functions

In this paper, theorems are proved concerned with some approximation properties of generating functions type Meyer-König and Zeller operators with the help of a Korovkin type theorem. Secondly, we compute the rates of convergence of these operators by means of the modulus of continuity, Peetre's K-functional and the elements of the modified Lipschitz class. Also we introduce the rth order generalization of these operators and we obtain approximation properties of them. In the last part, we give some applications to the differential equations.     

Convergence of inexact inverse iteration with application to preconditioned iterative solves

In this paper we study inexact inverse iteration for solving the generalised eigenvalue problem A x=λM x. We show that inexact inverse iteration is a modified Newton method and hence obtain convergence rates for various versions of inexact inverse iteration for the calculation of an algebraically simple eigenvalue. In particular, if the inexact solves are carried out with a tolerance chosen proportional to the eigenvalue residual then quadratic convergence is achieved. We also show how modifying the right hand side in inverse iteration still provides a convergent method, but the rate of convergence will be quadratic only under certain conditions on the right hand side. We discuss the implications of this for the preconditioned iterative solution of the linear systems. Finally we introduce a new ILU preconditioner which is a simple modification to the usual preconditioner, but which has advantages both for the standard form of inverse iteration and for the version with a modified right hand side. Numerical examples are given to illustrate the theoretical results. AMS subject classification (2000)  65F15, 65F10