Improvement of Simpson-Newton's iterative method
Qingwei Guo
Abstract
Qingwei Guo
Abstract
A kind of third-order convergence method for solving roots of nonlinear equation is developed by using Newton axiom.It is proved that third-order convergence nears simple root and the computational efficiency of the method is higher than that of other iterative methods.In the case of multiplicity m of roots of equation being known or unknown,the improved formula of the method and the order of convergence are given.Numerical tests are given and the results are compared with those of other iterative methods.It is shown that the proposed method is effective and it has some values in both theory and application.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A kind of third-order convergence method for solving roots of nonlinear equation is developed by using Newton axiom.It is proved that third-order convergence nears simple root and the computational efficiency of the method is higher than that of other iterative methods.In the case of multiplicity m of roots of equation being known or unknown,the improved formula of the method and the order of convergence are given.Numerical tests are given and the results are compared with those of other iterative methods.It is shown that the proposed method is effective and it has some values in both theory and application.
Key concepts: Mathematics, Newton's method, Local convergence, Convergence (economics), Iterative method, Applied mathematics, Newton's method in optimization, Nonlinear system