The purpose of this paper is that we give an extension of Halley’s method (Section 2), and the formulas to compare the convergences of the Halley’s method and extended one (Section 3). For extension of Halley’s met...The purpose of this paper is that we give an extension of Halley’s method (Section 2), and the formulas to compare the convergences of the Halley’s method and extended one (Section 3). For extension of Halley’s method we give definition of function by variable transformation in Section 1. In Section 4 we do the numerical calculations of Halley’s method and extended one for elementary functions, compare these convergences, and confirm the theory. Under certain conditions we can confirm that the extended Halley’s method has better convergence or better approximation than Halley’s method.展开更多
In the paper [1], authors have suggested and analyzed a predictor-corrector Halley method for solving nonlinear equations. In this paper, we modified this method by using the finite difference scheme, which had a quan...In the paper [1], authors have suggested and analyzed a predictor-corrector Halley method for solving nonlinear equations. In this paper, we modified this method by using the finite difference scheme, which had a quantic convergence. We have compared this modified Halley method with some other iterative methods of ninth order, which shows that this new proposed method is a robust one. Some examples are given to illustrate the efficiency and the performance of this new method.展开更多
Using the forms of Newton iterative function, the iterative function of Newton’s method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equ...Using the forms of Newton iterative function, the iterative function of Newton’s method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equations in one variable in this paper and show that their convergence order is at least quadratic. At last we employ our methods to solve some non-linear equations and compare them with Newton’s method and Halley’s method. Numerical results show that our iteration schemes are convergent if we choose two suitable parametric functions λ（x） and μ（x）. Therefore, our iteration schemes are feasible and effective.展开更多
In this paper we give an almost sharp error estimate of Halley’s iteration for the majorizing sequence. Compared with the corresponding results in [6,14], it is far better. Meanwhile,the convergence theorem is establ...In this paper we give an almost sharp error estimate of Halley’s iteration for the majorizing sequence. Compared with the corresponding results in [6,14], it is far better. Meanwhile,the convergence theorem is established .for Halley’s iteration in Banach spaces.展开更多
An inexact Halley＇s method-Halley-PCG（preconditioned conjugate gradient） method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by prec...An inexact Halley＇s method-Halley-PCG（preconditioned conjugate gradient） method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by preconditioned conjugate gradient method approximately. The convergence result is given and the efficiency of the method compared to the improved Halley＇s method is shown.展开更多
文摘The purpose of this paper is that we give an extension of Halley’s method (Section 2), and the formulas to compare the convergences of the Halley’s method and extended one (Section 3). For extension of Halley’s method we give definition of function by variable transformation in Section 1. In Section 4 we do the numerical calculations of Halley’s method and extended one for elementary functions, compare these convergences, and confirm the theory. Under certain conditions we can confirm that the extended Halley’s method has better convergence or better approximation than Halley’s method.
文摘In the paper [1], authors have suggested and analyzed a predictor-corrector Halley method for solving nonlinear equations. In this paper, we modified this method by using the finite difference scheme, which had a quantic convergence. We have compared this modified Halley method with some other iterative methods of ninth order, which shows that this new proposed method is a robust one. Some examples are given to illustrate the efficiency and the performance of this new method.
基金Supported by the National Natural Science Foundation of China (Grant Nos.6077304360473114)+5 种基金the Key Project Foundation of Scientific Research, Ministry of Education of China (Grant No.309017)the Doctoral Program Foundation of Ministry of Education of China (Grant No.20070359014)the Natural Science Key Foundation of Education Department of Anhui Province (Grant No.KJ2010A237)the Research Funds for Young Innovation Group of Education Department of Anhui Province (Grant No.2005TD03)the Provincial Foundation for Excellent Young Talents of Colleges and Universities of Anhui Province (Grant No.2010SQRL118)the Research Funds for Young Teachers in the College of Education Department of Anhui Province (Grant No.2008jq1158)
文摘Using the forms of Newton iterative function, the iterative function of Newton’s method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equations in one variable in this paper and show that their convergence order is at least quadratic. At last we employ our methods to solve some non-linear equations and compare them with Newton’s method and Halley’s method. Numerical results show that our iteration schemes are convergent if we choose two suitable parametric functions λ（x） and μ（x）. Therefore, our iteration schemes are feasible and effective.
基金Jointly supported by China Major Key Project for Basic Researcher and Provincial Natrual Science Foundation.
文摘In this paper we give an almost sharp error estimate of Halley’s iteration for the majorizing sequence. Compared with the corresponding results in [6,14], it is far better. Meanwhile,the convergence theorem is established .for Halley’s iteration in Banach spaces.
文摘An inexact Halley＇s method-Halley-PCG（preconditioned conjugate gradient） method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by preconditioned conjugate gradient method approximately. The convergence result is given and the efficiency of the method compared to the improved Halley＇s method is shown.
基金Supported by the National Natural Science Foundation of China(1140104611301036)+1 种基金the Scientific Research Foundation of the Education Department of Jilin Province(JJKH20170536KJJJKH20170537KJ)
