On a class of quadratically convergent iteration formulae Mamta, V. Kanwar * , V.K. Kukreja, Sukhjit Singh Department of Mathematics, Sant Longowal Institute of Engineering and Technology, Sangrur 148 106, Longowal, Punjab, India Abstract In this paper a new class of iterative formulae having quadratic convergence is pre- sented. Furthermore, these algorithms are comparable to the well known method of Newton and the computed results support this theory. Ó 2004 Elsevier Inc. All rights reserved. Keywords: NewtonÕs method; Iterative formulae; Order of convergence 1. Introduction Almostalltheiterativetechniquesofsolutiontoanequationrequiretheprior knowledge of one or more initial guesses for the desired root. Once an interval is known to contain a root, several classical procedures are available to refine it further. Some of them are modified Regula-falsi [1], NewtonÕs method, Wu and Wu [2],WuandFu [3] etc. OstrowskiÕs [4] well-known book on the solution of equations contains the detailed description of an iterative method for finding 0096-3003/$ - see front matter Ó 2004 Elsevier Inc. All rights reserved. doi:10.1016/j.amc.2004.07.008 * Corresponding author. E-mail address: vmithil@yahoo.co.in (V. Kanwar). Applied Mathematics and Computation 166 (2005) 633–637 www.elsevier.com/locate/amc