A three point formula for finding roots of equations by the method of least squares

zbMATH Open1308.65070arXiv1302.1966MaRDI QIDQ2939092FDOQ2939092

Authors: Ababu Teklemariam Tiruneh, W. N. Ndlela, S. J. Nkambule 

Publication date: 16 January 2015

Abstract: A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that passes between three equi-spaced points using the method of least squares. Successive iterations using the same procedure of curve fitting is used to locate the root within a given level of tolerance. The power N of the curve suitable for a given function form can be appropriately varied at each step of the iteration to give a faster rate of convergence and avoid cases where oscillation, divergence or off shooting to an invalid domain may be encountered. An estimate of the rate of convergence is provided. It is shown that the method has a quadratic convergence similar to that of Newton's method. Examples are provided showing the procedure as well as comparison of the rate of convergence with the secant and Newton methods. The method does not require evaluation of function derivatives.

Full work available at URL: https://arxiv.org/abs/1302.1966

Recommendations

• Nonlinear equations root based on three-points quadratic interpolation
• An optimal multiple root-finding method of order three
• Simple methods for computing the least squares line in three dimensions
• Point estimation of root finding methods
• Locating three-dimensional roots by a bisection method
• Local convergence of a three-point method for solving least squares problems
• Approximate solution of a system of three-point vector equations with constant coefficients
• scientific article; zbMATH DE number 749533
• Three points method for searching the best least absolute deviations plane

zbMATH Keywords

convergencenumerical examplescurve fittingiterative techniquesNewton's methodmethod of least squaresroots of equationsroot approximationsthree point formula

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Cited In (3)

• A new cubic method for computing a root
• Some iterative methods free from derivatives and their basins of attraction for nonlinear equations
• Locating three-dimensional roots by a bisection method

This page was built for publication: A three point formula for finding roots of equations by the method of least squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939092)