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

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

Chebysheff-Halley-like methods in Banach spaces

Chebysheff-Halley methods are probably the best known cubically convergent iterative procedures for solving nonlinear equations. These methods however require an evaluation of the second Fréchet-derivative at each step which means a number of function evaluations proportional to the cube of the dimension of the space. To reduce the computational cost we replace the second Fréchet derivative with a fixed bounded bilinear operator. Using the majorant method and Newton-Kantorovich type hypotheses we provide sufficient conditions for the convergence of our method to a locally unique solution of a nonlinear equation in Banach space. Our method is shown to be faster than Newton’s method under the same computational cost. Finally we apply our results to solve nonlinear integral equations appearing in radiative transfer in connection with the problem of determination of the angular distribution of the radiant-flux emerging from a plane radiation field.     

Zero-finder methods derived from Obreshkov’s techniques

In this paper two families of zero-finding iterative methods for solving nonlinear equations f(x)=0 are presented. The key idea to derive them is to solve an initial value problem applying Obreshkov-like techniques. More explicitly, Obreshkov’s methods have been used to numerically solve an initial value problem that involves the inverse of the function f that defines the equation. Carrying out this procedure, several methods with different orders of local convergence have been obtained. An analysis of the efficiency of these methods is given. Finally we introduce the concept of extrapolated computational order of convergence with the aim of numerically test the given methods. A procedure for the implementation of an iterative method with an adaptive multi-precision arithmetic is also presented.     

Picard’s iterative method for nonlinear advection-reaction-diffusion equations

Picard’s iterative method for the solution of nonlinear advection-reaction-diffusion equations is formulated and its convergence proved. The method is based on the introduction of a complete metric space and makes uses of a contractive mapping and Banach’s fixed-point theory. From Picard’s iterative method, the variational iteration method is derived without making any use at all of Lagrange multipliers and constrained variations. Some examples that illustrate the advantages and shortcomings of the iterative procedure presented here are shown.     

On a simultaneous method of Newton-Weierstrass’ type for finding all zeros of a polynomial

Combining a suitable two-point iterative method for solving nonlinear equations and Weierstrass’ correction, a new iterative method for simultaneous finding all zeros of a polynomial is derived. It is proved that the proposed method possesses a cubic convergence locally. Numerical examples demonstrate a good convergence behavior of this method in a global sense. It is shown that its computational efficiency is higher than the existing derivative-free methods.     

A hybrid approximation method for solving Hutchinson’s equation

The hybrid function approximation method for solving Hutchinson’s equation which is a nonlinear delay partial differential equation, is investigated. The properties of hybrid of block-pulse functions and Lagrange interpolating polynomials based on Legendre-Gauss-type points are presented and are utilized to replace the system of nonlinear delay differential equations resulting from the application of Legendre pseudospectral method, by a system of nonlinear algebraic equations. The validity and applicability of the proposed method are demonstrated through two illustrative examples on Hutchinson’s equation.     

The simplest equation method to study perturbed nonlinear Schrödinger’s equation with Kerr law nonlinearity

The simplest equation method is a powerful solution method for obtaining exact solutions of nonlinear evolution equations.In this paper, the simplest equation method is used to construct exact solutions of nonlinear Schrödinger’s equation and perturbed nonlinear Schrödinger’s equation with Kerr law nonlinearity. It is shown that the proposed method is effective and general.     

A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs

In this paper, a family of fourth-order Steffensen-type two-step methods is constructed to make progress in including Ren-Wu-Bi’s methods [H. Ren, Q. Wu, W. Bi, A class of two-step Steffensen type methods with fourth-order convergence, Appl. Math. Comput. 209 (2009) 206-210] and Liu-Zheng-Zhao’s method [Z. Liu, Q. Zheng, P. Zhao, A variant of Steffensens method of fourth-order convergence and its applications, Appl. Math. Comput. 216 (2010) 1978-1983] as its special cases. Its error equation and asymptotic convergence constant are deduced. The family provides the opportunity to obtain derivative-free iterative methods varying in different rates and ranges of convergence. In the numerical examples, the family is not only compared with the related methods for solving nonlinear equations, but also applied in the solution of BVPs of nonlinear ODEs by the finite difference method and the multiple shooting method.     

A new modification of the Adomian decomposition method for solving boundary value problems for higher order nonlinear differential equations

In this paper we propose a new modified recursion scheme for the resolution of multi-order and multi-point boundary value problems for nonlinear ordinary and partial differential equations by the Adomian decomposition method (ADM). Our new approach, including Duan’s convergence parameter, provides a significant computational advantage by allowing for the acceleration of convergence and expansion of the interval of convergence during calculations of the solution components for nonlinear boundary value problems, in particular for such cases when one of the boundary points lies outside the interval of convergence of the usual decomposition series. We utilize the boundary conditions to derive an integral equation before establishing the recursion scheme for the solution components. Thus we can derive a modified recursion scheme without any undetermined coefficients when computing successive solution components, whereas several prior recursion schemes have done so. This modification also avoids solving a sequence of nonlinear algebraic equations for the undetermined coefficients fraught with multiple roots, which is required to complete calculation of the solution by several prior modified recursion schemes using the ADM.     

An approximate method for solving a class of weakly-singular Volterra integro-differential equations

In this paper, we present a new approach to resolve linear and nonlinear weakly-singular Volterra integro-differential equations of first- or second-order by first removing the singularity using Taylor’s approximation and then transforming the given first- or second-order integro-differential equations into an ordinary differential equation such as the well-known Legendre, degenerate hypergeometric, Euler or Abel equations in such a manner that Adomian’s asymptotic decomposition method can be applied, which permits convenient resolution of these equations. Some examples with closed-form solutions are studied in detail to further illustrate the proposed technique, and the results obtained demonstrate this approach is indeed practical and efficient.     

Stability of functional equations in single variable

This paper discusses Hyers-Ulam stability for functional equations in single variable, including the forms of linear functional equation, nonlinear functional equation and iterative equation. Surveying many known and related results, we clarify the relations between Hyers-Ulam stability and other senses of stability such as iterative stability, continuous dependence and robust stability, which are used for functional equations. Applying results of nonlinear functional equations we give the Hyers-Ulam stability of Böttcher's equation. We also prove a general result of Hyers-Ulam stability for iterative equations.     

Newton methods for a class of nonlinear hypersingular integral equations

Different iterative schemes based on collocation methods have been well studied and widely applied to the numerical solution of nonlinear hypersingular integral equations (Capobianco et al. 2005). In this paper we apply Newton’s method and its modified version to solve the equations obtained by applying a collocation method to a nonlinear hypersingular integral equation of Prandtl’s type. The corresponding convergence results are derived in suitable Sobolev spaces. Some numerical tests are also presented to validate the theoretical results.     

A rational generalization of Fan’s method and its application to generalized shallow water wave equations

In this paper we employ a rational expansion to generalize Fan’s method for exact travelling wave solutions for nonlinear partial differential equations (PDEs). To verify the reliability of the proposed method, the generalized shallow water wave (GSWW) equation has been investigated as an example. Kinds of new exact travelling wave solutions of a rational form have been obtained. This indicates that the proposed method provides a more general result for exact solution of nonlinear equations.     

Adomian’s decomposition method and homotopy perturbation method in solving nonlinear equations

The Adomian’s decomposition method and the homotopy perturbation method are two powerful methods which consider the approximate solution of a nonlinear equation as an infinite series usually converging to the accurate solution. By theoretical analysis of the two methods, we show, in the present paper, that the two methods are equivalent in solving nonlinear equations.     

Approximations of the nonlinear Volterra's population model by an efficient numerical method

In this paper, we apply the new homotopy perturbation method to solve the Volterra's model for population growth of a species in a closed system. This technique is extended to give solution for nonlinear integro‐differential equation in which the integral term represents the total metabolism accumulated fromtime zero. The approximate analytical procedure only depends on two components. The newhomotopy perturbationmethodwas applied to nonlinear integro‐differential equations directly and by converting the problem into nonlinear ordinary differential equation. We also compare this method with some other numerical results and show that the present approach is less computational and is applicable for solving nonlinear integro‐differential equations and ordinary differential equations as well. Copyright © 2011 John Wiley & Sons, Ltd.     

Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative

In recent years, a lot of iterative methods for finding multiple zeros of nonlinear equations have been presented and analyzed. However, almost all these studies give no information for the convergence radius of the corresponding method. In this paper, we give an estimate of the convergence radius of the well-known modified Newton’s method for multiple zeros, when the involved function satisfies a Hölder and center-Hölder continuity condition.     

Improved Newton’s method without direct function evaluations

For solving systems of nonlinear equations, we have recently developed a Newton’s method to manage issues with inaccurate function values or problems with high computational cost. In this work we introduce a modification of the above method, reducing the total computational cost and improving, in general, its overall performance. Moreover, the proposed version retains the quadratic convergence, the good behavior over singular and ill-conditioned cases of Jacobian matrix, and its capability to be ideal for imprecise function problems. Numerical results demonstrate the efficiency of the new proposed method.     

Some higher-order modifications of Newton’s method for solving nonlinear equations

In this paper we consider constructing some higher-order modifications of Newton’s method for solving nonlinear equations which increase the order of convergence of existing iterative methods by one or two or three units. This construction can be applied to any iteration formula, and per iteration the resulting methods add only one additional function evaluation to increase the order. Some illustrative examples are provided and several numerical results are given to show the performance of the presented methods.     

Numerical analysis for the quadratic matrix equations from a modification of fixed‐point type

In this paper, we study the quadratic matrix equations. To improve the application of iterative schemes, we use a transform of the quadratic matrix equation into an equivalent fixed‐point equation. Then, we consider an iterative process of Chebyshev‐type to solve this equation. We prove that this iterative scheme is more efficient than Newton's method. Moreover, we obtain a local convergence result for this iterative scheme. We finish showing, by an application to noisy Wiener‐Hopf problems, that the iterative process considered is computationally more efficient than Newton's method.     

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.