On the convergence of a fourth order evolution equation to the Allen-Cahn equation

We construct special sequences of solutions to a fourth order nonlinear parabolic equation of Cahn-Hilliard/Allen-Cahn type, converging to the second order Allen-Cahn equation. We consider the evolution equation without boundary, as well as the stationary case on domains with Dirichlet boundary conditions. The proofs exploit the equivalence of the fourth order equation with a system of two second order elliptic equations with “good signs”.     

New third and fourth order nonlinear solvers for computing multiple roots

We present a new third order method for finding multiple roots of nonlinear equations based on the scheme for simple roots developed by Kou et al. [J. Kou, Y. Li, X. Wang, A family of fourth-order methods for solving non-linear equations, Appl. Math. Comput. 188 (2007) 1031-1036]. Further investigation gives rise to new third and fourth order families of methods which do not require second derivative. The fourth order family has optimal order, since it requires three evaluations per step, namely one evaluation of function and two evaluations of first derivative. The efficacy is tested on a number of relevant numerical problems. Computational results ascertain that the present methods are competitive with other similar robust methods.     

Modified Jarratt method with sixth-order convergence

In this paper, we present a variant of Jarratt method with order of convergence six for solving non-linear equations. Per iteration the method requires two evaluations of the function and two of its first derivatives. The new multistep iteration scheme, based on the new method, is developed and numerical tests verifying the theory are also given.     

Certain improvements of Newton’s method with fourth-order convergence

In this paper we present two new schemes, one is third-order and the other is fourth-order. These are improvements of second-order methods for solving nonlinear equations and are based on the method of undetermined coefficients. We show that the fourth-order method is more efficient than the fifth-order method due to Kou et al. [J. Kou, Y. Li, X. Wang, Some modifications of Newton’s method with fifth-order covergence, J. Comput. Appl. Math., 209 (2007) 146–152]. Numerical examples are given to support that the methods thus obtained can compete with other iterative methods.     

Some improvements of Jarratt’s method with sixth-order convergence

In this paper, we present a one-parameter family of variants of Jarratt’s fourth-order method for solving nonlinear equations. It is shown that the order of convergence of each family member is improved from four to six even though it adds one evaluation of the function at the point iterated by Jarratt’s method per iteration. Several numerical examples are given to illustrate the performance of the presented methods.     

The convergence of the perturbed Newton method and its application for ill-conditioned problems

Iterative methods, such as Newton’s, behave poorly when solving ill-conditioned problems: they become slow (first order), and decrease their accuracy. In this paper we analyze deeply and widely the convergence of a modified Newton method, which we call perturbed Newton, in order to overcome the usual disadvantages Newton’s one presents. The basic point of this method is the dependence of a parameter affording a degree of freedom that introduces regularization. Choices for that parameter are proposed. The theoretical analysis will be illustrated through examples.     

Some sixth order zero-finding variants of Chebyshev-Halley methods

A zero-finding technique in which the order of convergence is improved and nonlinear equations are solved more efficiently than they are solved by traditional iterative methods is derived. Composing a modified Chebyshev-Halley method with a variant of this method that just introduces one evaluation of the function the iterative methods presented are obtained. By carrying out this procedure the output numerical results show that the new methods compete in both order and efficiency with the modified Chebyshev-Halley methods.     

A third order method for fixed points in Banach spaces

This paper deals with a third order Stirling-like method used for finding fixed points of nonlinear operator equations in Banach spaces. The semilocal convergence of the method is established by using recurrence relations under the assumption that the first Fréchet derivative of the involved operator satisfies the Hölder continuity condition. A theorem is given to establish the error bounds and the existence and uniqueness regions for fixed points. The R-order of the method is also shown to be equal to at least (2p+1) for p∈(0,1]. The efficacy of our approach is shown by solving three nonlinear elementary scalar functions and two nonlinear integral equations by using both Stirling-like method and Newton-like method. It is observed that our convergence analysis is more effective and give better results.     

The cubic semilocal convergence on two variants of Newton's method

In this paper, we discuss two variants of Newton's method without using any second derivative for solving nonlinear equations. By using the majorant function and confirming the majorant sequences, we obtain the cubic semilocal convergence and the error estimation in the Kantorovich-type theorems. The numerical examples are presented to support the usefulness and significance.     

On the convergence of parallel chaotic nonlinear multisplitting Newton-type methods

A class of parallel chaotic nonlinear multisplitting Newton-type methods for solving the nonlinear system of equations F(x) = 0(F : D Rⁿ → Rⁿ) is established and its local convergence theory is presented.     

New modifications of Potra-Pták’s method with optimal fourth and eighth orders of convergence

In this paper, we present two new iterative methods for solving nonlinear equations by using suitable Taylor and divided difference approximations. Both methods are obtained by modifying Potra-Pták’s method trying to get optimal order. We prove that the new methods reach orders of convergence four and eight with three and four functional evaluations, respectively. So, Kung and Traub’s conjecture Kung and Traub (1974) [2], that establishes for an iterative method based on n evaluations an optimal order p=2ⁿ⁻¹ is fulfilled, getting the highest efficiency indices for orders p=4 and p=8, which are 1.587 and 1.682.We also perform different numerical tests that confirm the theoretical results and allow us to compare these methods with Potra-Pták’s method from which they have been derived, and with other recently published eighth-order methods.     

A class of Steffensen type methods with optimal order of convergence

In this paper, a family of Steffensen type methods of fourth-order convergence for solving nonlinear smooth equations is suggested. In the proposed methods, a linear combination of divided differences is used to get a better approximation to the derivative of the given function. Each derivative-free member of the family requires only three evaluations of the given function per iteration. Therefore, this class of methods has efficiency index equal to 1.587. Kung and Traub conjectured that the order of convergence of any multipoint method without memory cannot exceed the bound 2^d-1, where d is the number of functional evaluations per step. The new class of methods agrees with this conjecture for the case d=3. Numerical examples are made to show the performance of the presented methods, on smooth and nonsmooth equations, and to compare with other ones.     

A fourth order ADI method for semidiscrete parabolic equations

A fourth order fourstep ADI method is described for solving the systems of ordinary differential equations which are obtained when a (nonlinear) parabolic initial-boundary value problem in two dimensions is semi-discretized. The local time-discretization error and the stability conditions are derived. By numerical experiments it is demonstrated that the (asymptotic) fourth order behaviour does not degenerate if the time step increases to relatively large values. Also a comparison is made with the classical ADI method of Peaceman and Rachford showing the superiority of the fourth order method in the higher accuracy region, particularly in nonlinear problems.     

Some variants of Ostrowski's method with seventh-order convergence

In this paper, we present a class of new variants of Ostrowski's method with order of convergence seven. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative and therefore this class of methods has the efficiency index equal to 1.627. Numerical tests verifying the theory are given, and multistep iterations, based on the present methods, are developed.     

Semilocal and global convergence of the Newton‐HSS method for systems of nonlinear equations

Newton‐HSS methods, which are variants of inexact Newton methods different from the Newton–Krylov methods, have been shown to be competitive methods for solving large sparse systems of nonlinear equations with positive‐definite Jacobian matrices (J. Comp. Math. 2010; 28 :235–260). In that paper, only local convergence was proved. In this paper, we prove a Kantorovich‐type semilocal convergence. Then we introduce Newton‐HSS methods with a backtracking strategy and analyse their global convergence. Finally, these globally convergent Newton‐HSS methods are shown to work well on several typical examples using different forcing terms to stop the inner iterations. Copyright © 2010 John Wiley & Sons, Ltd.     

Some second-derivative-free variants of Halley’s method for multiple roots

In this paper, we present two new families of third-order methods for finding multiple roots of nonlinear equations. Each of them is based on a variant of the Halley’s method (for simple roots) free from second derivative. One of the families requires one evaluation of the function and two of its first derivative per iteration, and the other family requires two evaluations of the function and one of its first derivative. Several numerical examples are given to illustrate the performance of the presented methods.     

Newton-like method with modification of the right-hand-side vector

This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate, while the correction is performed on the right-hand-side vector of the Newton system. In this way a method is obtained which is less costly than the Newton method and faster than the fixed Newton method. Local convergence is proved for nonsingular systems. The influence of the relaxation parameter is analyzed and explicit formulae for the selection of an optimal parameter are presented. Relevant numerical examples are used to demonstrate the advantages of the proposed method.