Newton’s method is used to find the roots of a system of equations <span style="white-space:nowrap;"><em>f</em> (x) = 0</span>. It is one of the most important procedures in numerica...Newton’s method is used to find the roots of a system of equations <span style="white-space:nowrap;"><em>f</em> (x) = 0</span>. It is one of the most important procedures in numerical analysis, and its applicability extends to differential equations and integral equations. Analysis of the method shows a quadratic convergence under certain assumptions. For several years, researchers have improved the method by proposing modified Newton methods with salutary efforts. A modification of the Newton’s method was proposed by McDougall and Wotherspoon <a href="#ref1">[1]</a> with an order of convergence of <span style="white-space:nowrap;">1+ <span style="white-space:nowrap;">√2</span></span>. On a new type of methods with cubic convergence was proposed by H. H. H. Homeier <a href="#ref2">[2]</a>. In this article, we present a new modification of Newton method based on secant method. Analysis of convergence shows that the new method is cubically convergent. Our method requires an evaluation of the function and one of its derivatives.展开更多
In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and di...In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.展开更多
A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots ...A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton and Newton-type methods. The results show that the proposed method has some more advantages than others. It enriches the methods to find the roots of non-linear equations and it is important in both theory and application.展开更多
We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the numb...We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.展开更多
In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order...In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.展开更多
The programs offered for solving nonlinear equations, usually the old method, such as alpha, chordal movement, Newton, etc. have been used. Among these methods may Newton’s method of them all be better and higher int...The programs offered for solving nonlinear equations, usually the old method, such as alpha, chordal movement, Newton, etc. have been used. Among these methods may Newton’s method of them all be better and higher integration. In this paper, we propose the integration method for finding the roots of nonlinear equation we use. In this way, Newton’s method uses integration methods to obtain. In previous work, [1] and [2] presented numerical integration methods such as integration, trapezoidal and rectangular integration method that are used. The new method proposed here, uses Simpson’s integration. With this method, the approximation error is reduced. The calculated results show that this hypothesis is confirmed.展开更多
Independent component analysis （ICA） is the primary statistical method for solving the problems of blind source separation. The fast ICA is a famous and excellent algorithm and its contrast function is optimized by ...Independent component analysis （ICA） is the primary statistical method for solving the problems of blind source separation. The fast ICA is a famous and excellent algorithm and its contrast function is optimized by the quadratic convergence of Newton iteration method. In order to improve the convergence speed and the separation precision of the fast ICA, an improved fast ICA algorithm is presented. The algorithm introduces an efficient Newton＇s iterative method with fifth-order convergence for optimizing the contrast function and gives the detail derivation process and the corresponding condition. The experimental results demonstrate that the convergence speed and the separation precision of the improved algorithm are better than that of the fast ICA.展开更多
文摘Newton’s method is used to find the roots of a system of equations <span style="white-space:nowrap;"><em>f</em> (x) = 0</span>. It is one of the most important procedures in numerical analysis, and its applicability extends to differential equations and integral equations. Analysis of the method shows a quadratic convergence under certain assumptions. For several years, researchers have improved the method by proposing modified Newton methods with salutary efforts. A modification of the Newton’s method was proposed by McDougall and Wotherspoon <a href="#ref1">[1]</a> with an order of convergence of <span style="white-space:nowrap;">1+ <span style="white-space:nowrap;">√2</span></span>. On a new type of methods with cubic convergence was proposed by H. H. H. Homeier <a href="#ref2">[2]</a>. In this article, we present a new modification of Newton method based on secant method. Analysis of convergence shows that the new method is cubically convergent. Our method requires an evaluation of the function and one of its derivatives.
基金national natural science foundation natural science foundation of Gansu province.
文摘In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.
基金Foundation item： Supported by the National Science Foundation of China（10701066） Supported by the National Foundation of the Education Department of Henan Province（2008A110022）
文摘A fourth-order convergence method of solving roots for nonlinear equation, which is a variant of Newton＇s method given. Its convergence properties is proved. It is at least fourth-order convergence near simple roots and one order convergence near multiple roots. In the end, numerical tests are given and compared with other known Newton and Newton-type methods. The results show that the proposed method has some more advantages than others. It enriches the methods to find the roots of non-linear equations and it is important in both theory and application.
文摘We propose a continuous analogy of Newton’s method with inner iteration for solving a system of linear algebraic equations. Implementation of inner iterations is carried out in two ways. The former is to fix the number of inner iterations in advance. The latter is to use the inexact Newton method for solution of the linear system of equations that arises at each stage of outer iterations. We give some new choices of iteration parameter and of forcing term, that ensure the convergence of iterations. The performance and efficiency of the proposed iteration is illustrated by numerical examples that represent a wide range of typical systems.
基金supported by National Natural Science Foundation of China(NSFC)Key Program(61573094)the Fundamental Research Funds for the Central Universities(N140402001)
文摘In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.
文摘The programs offered for solving nonlinear equations, usually the old method, such as alpha, chordal movement, Newton, etc. have been used. Among these methods may Newton’s method of them all be better and higher integration. In this paper, we propose the integration method for finding the roots of nonlinear equation we use. In this way, Newton’s method uses integration methods to obtain. In previous work, [1] and [2] presented numerical integration methods such as integration, trapezoidal and rectangular integration method that are used. The new method proposed here, uses Simpson’s integration. With this method, the approximation error is reduced. The calculated results show that this hypothesis is confirmed.
文摘Independent component analysis （ICA） is the primary statistical method for solving the problems of blind source separation. The fast ICA is a famous and excellent algorithm and its contrast function is optimized by the quadratic convergence of Newton iteration method. In order to improve the convergence speed and the separation precision of the fast ICA, an improved fast ICA algorithm is presented. The algorithm introduces an efficient Newton＇s iterative method with fifth-order convergence for optimizing the contrast function and gives the detail derivation process and the corresponding condition. The experimental results demonstrate that the convergence speed and the separation precision of the improved algorithm are better than that of the fast ICA.
