Several new methods for solving equations

References

• Aitken , A. C. 1926 . On Bernoulli's numerical solution of algebraic equations . Proc. Roy. Soc. Edinburgh , 46 : 289 – 305 .
   Google Scholar
• Aitken , A. C. 1931 . Further numerical studies in algebraic equations . Proc. Roy. Soc. Edinburgh , 51 : 80 – 90 .
   Google Scholar
• Altman , M. 1955 . A generalization of Newton's method . Bull. Acad. Polon. Sci. , C1 III 3 : 189 – 193 .
   Google Scholar
• Altman , M. 1961 . Iterative methods of higher order . Bull. Acad. Sci. Polon. Sci. Ser. Math. Astr. Phys. , 9 : 63 – 68 .
   Google Scholar
• Anderson , N. and Bjorck , A. 1973 . A new high order method of Regula Falsi type for computing a root of an equation . BIT , 13 : 253 – 264 .
   Google Scholar
• Bateman , E. H. 1938 . Halley's methods of solving equations . Amer. Math. Monthly , 45 : 11 – 17 .
   Google Scholar
• Bateman , E. H. 1953 . The solution of algebraic and transcendental equations by iteration . Math. Gaz. , 37 : 96 – 101 .
   Google Scholar
• Bodewig , E. 1946 . Sur la method Laguerre pour l'approximation des racines de certaines equations algébriques et sur la critique d'Hermite . Indag. Math. , 8 : 570 – 580 .
   Google Scholar
• Brent , R. P. 1971 . An algorithm with guaranteed convergence for finding a zero of a function . Computer J. , 14 : 422 – 425 .
   Web of Science ®Google Scholar
• Brent , R. P. , Winograd , S. and Wolfe , P. 1973 . Optimal iterative processes for root-finding . Numer. Math. , 20 : 327 – 341 .
   Google Scholar
• Bus J. C. P. Dekker T. J. Two efficient algorithms with guaranteed convergence for finding a zero of a function Mathematical Centre Report NW 13/74 Assoc. Comput. Mach. Toms 1 Sept 1975 330 345
   Google Scholar
• Carvallo E. Methode pratique pour la resolution numerique des equations algebriques ou transcendantes Doctoral thesis Paris 1890
   Google Scholar
• Cauchy , A. 1840 . Sur la resolution numerique des equations algebriques et trans cendantes . C. R. Acad. Sci. Paris , 11 : 829 – 847 .
   Google Scholar
• Cauchy , A. 1899 . Sur la determination approximative des racines d'une equation algebrique ou transcendante . Oeuvres Completes Serie , 2 ( 4 ) : 573 – 609 . Gauthier Villars, Paris
   Google Scholar
• Chambers , L. G. 1971 . A quadratic formula for finding the root of an equation . Math. Comp. , 25 ( 4 ) : 305 – 307 .
   Google Scholar
• Chambers , M. L. and Jarratt , P. 1964 . Use of double sampling for selecting best population . Biometrika , 51 ( 1-2 ) : 49 – 64 .
   Web of Science ®Google Scholar
• van der Corput , J. G. 1946 . Sur l'approximation de Laguerre des racines d'une equation qui a toutes ses racines reelles . Nederl. Akad. Wetensch. Proc. , 49 ( 1-2 ) : 922 – 929 .
   Google Scholar
• Cox , M. G. 1970 . A bracketing technique for computing a zero of a function . Computer J. , 13 ( 1-2 ) : 101 – 102 .
   Google Scholar
• Cox , M. G. 1972 . A note on Chamber's method for finding a zero of a function . Math. Comp. , 26 ( 1-2 ) : 749 – 749 .
   Google Scholar
• Davies , M. and Dawson , B. 1975 . On the global convergence of Halley's iteration formula . Numer. Math. , 24 ( 1-2 ) : 133 – 135 .
   Web of Science ®Google Scholar
• Dekker , T. J. 1969 . “ Finding a zero by means of successive linear interpolation ” . In Constructive Aspects of the Fundamental Theorem of Algebra , Edited by: Dejon , B. and Henrici , P. London : Wiley Interscience .
   Google Scholar
• Dordjevic , L. N. 1973 . An iterative solution of algebraic equations with a parameter to accelerate convergence . Univ. Beograd. Publ. Elektrotechn. Fak. Ser. Mat. Fiz. , 449 : 179 – 182 .
   Google Scholar
• Dowell , M. and Jarratt , P. 1971 . A modified Regula Falsi method of computing the root of an equation . BIT , 11 : 168 – 174 .
   Google Scholar
• Dowell , M. and Jarratt , P. 1972 . The “Pegasus” method for computing the root of an equation . BIT , 12 : 503 – 508 .
   Google Scholar
• Durand , E. 1960 . Solutions numeriques des equations algebriques . Masson et Cie , 2 Paris
   Google Scholar
• Forsythe G. E. Note on high-order algorithms for solving transcendental equations Unpublished report Stanford University 1957
   Google Scholar
• Foster , L. V. 1981 . Generalizations of Laguerre's method: Higher order methods . SIAM J. Numer. Anal. , 18 : 1004 – 1018 .
   Web of Science ®Google Scholar
• Frame , J. S. 1944 . A variation of Newton's method . Amer. Math. Monthly , 51 : 36 – 38 .
   Google Scholar
• Frame , J. S. 1945 . Remarks on a variation of Newton's method . Amer. Math. Monthly , 52 : 212 – 214 .
   Google Scholar
• Frank , E. 1955 . On the calculations of the roots of equations . J. Math, and Phys. , 34 : 187 – 197 . now Studies in Appl. Math.
   Google Scholar
• Frank , W. L. 1958 . Finding zeros of arbitrary functions . J. Assoc. Comput. Mach. , 5 : 154 – 160 .
   Web of Science ®Google Scholar
• Galeone , L. 1977 . Generalizzazione del metodo di Laguerre . Calcolo , 14 : 121 – 131 .
   Google Scholar
• Galeone , L. 1978 . Un metodo iterativo non stazionario per la risoluzione di equazioni algebriche . Calcolo , 15 : 289 – 298 .
   Google Scholar
• Gleyzal , A. N. 1959 . Solution of nonlinear equations . Quart. Appl. Math. , 17 : 95 – 96 .
   Google Scholar
• Gerald , C. F. and Wheatley , P. O. 1985 . Applied Numerical Analysis , Reading, MA : Addison Wesley Pub. Co. .
   Google Scholar
• Gorecki , H. and Turowicz , A. B. 1962 . Sur la resolution des equations algebriques par la methode de Euler . Ann. Polon. Math. , 12 : 185 – 190 .
   Google Scholar
• Gornstein , M. S. 1951 . The numerical solution of equations . Dokl. Akad. Nauk SSSR , 78 : 193 – 196 . Russian
   Google Scholar
• Grave , D. 1936 . Algorithme du calcul des racines des equations algebriques . J. Math. Inst. Ukrainian Academy of Sciences , 2 : 3 – 20 .
   Google Scholar
• Halley , E. 1694 . A new, exact and easy method of finding the roots of equations generally and that without any previous reduction . Phil. Trans. Roy. Soc. London , 18 : 136 – 148 .
   Google Scholar
• Hamilton , H. J. 1946 . Roots of equations by functional iteration . Duke Math. J. , 13 : 113 – 121 .
   Google Scholar
• Hamilton , H. J. 1950 . A type of variation on Newton's method . Amer. Math. Monthly , 57 : 517 – 522 .
   Google Scholar
• Hansen , E. and Patrick , M. 1977 . A family of root finding methods . Numer. Math. , 27 : 257 – 269 .
   Web of Science ®Google Scholar
• Hartman , P. 1948 . Newtonian approximations to a zero of a function . Comm. Math. Helv. , 21 : 321 – 326 .
   Google Scholar
• Hartree , D. R. 1949 . Notes on iterative processes . Proc. Cambridge Phil. Soc. , 45 : 230 – 236 .
   Google Scholar
• Hitotumatu , S. 1972 . A method of successive approximation based on the expansion of second order . Math. Japon. , 7 : 31 – 50 .
   Google Scholar
• Hochstrasser , U. 1962 . “ Numerical methods for finding solutions of nonlinear equations ” . In A Survey of Numerical Analysis , Edited by: Todd , J. 255 – 278 . New York : McGraw-Hill Book Company, Inc. .
   Google Scholar
• Hofsommer , D. J. 1958 . Note on the computation of the zeros of functions satisfying a second order differential equation . Math. Table & Other Aids Comp. , 12 : 58 – 60 .
   Google Scholar
• Householder , A. S. 1951 . Polynomial iterations to roots of algebraic equations . Proc. Amer. Math. Soc. , 2 : 718 – 719 .
   Google Scholar
• Hsu , L. C. 1958 . A few useful modifications of Newton's approximation method of solving real equations . Math. Student , 26 : 145 – 153 .
   Google Scholar
• Jarratt , P. and Nudds , D. 1965 . The use of rational functions in the iterative solution of equations on a digital computer . Computer J. , 8 : 62 – 65 .
   Web of Science ®Google Scholar
• Jarratt , P. 1966 . Some fourth order multipoint methods for solving equations . Math. Comp. , 20 : 434 – 437 .
   Web of Science ®Google Scholar
• Jarratt , P. 1966 . Multipoint iterative methods for solving certain equations . Computer J. , 8 : 398 – 400 .
   Web of Science ®Google Scholar
• Jarratt , P. 1966 . A rational iteration function for solving equations . Computer J. , 9 : 304 – 307 .
   Google Scholar
• Jarratt , P. 1967 . A note on the asymptotic error constant of a certain method for solving equations . Computer J. , 9 : 408 – 409 .
   Google Scholar
• Jarratt , P. 1969 . Some efficient fourth order multipoint methods for solving equations . BIT , 9 : 119 – 124 .
   Google Scholar
• Jarratt , P. 1970 . “ A review of methods for solving nonlinear algebraic equations in one variable ” . In Numerical Methods for Nonlinear Algebraic Equations , Edited by: Rabinowitz , Ph. London : Gordon and Breach . New York, Paris
   Google Scholar
• Jeeves , T. A. 1958 . Secant modifications of Newton's method . Comm. Assoc. Comput. Mack , 1 ( 8 ) : 9 – 10 .
   Google Scholar
• Kantorovich , L. V. 1949 . On Newton's method . Trudy Mat. Inst. Steklov , 28 ( 8 ) : 104 – 144 .
   Google Scholar
• Kantorovich , L. V. 1957 . On some further applications of the Newton approxi mation method (Russian) . Vestnik Leningrad Univ. , 7 ( 8 ) : 68 – 103 .
   Google Scholar
• Kerner , I. O. 1966 . Algorithm 238 . Comm. Assoc. Comput. Mach. , 9 ( 8 ) : 273 – 273 .
   Google Scholar
• Kincaid , W. M. 1948 . Solution of equations by interpolation . Ann. Math. Statis. , 19 ( 8 ) : 207 – 219 .
   Google Scholar
• King , R. F. 1971 . A fifth-order family of modified Newton methods . BIT , 11 ( 8 ) : 409 – 412 .
   Google Scholar
• King , R. F. 1973 . Tangent methods for nonlinear equations . Numer. Math. , 13 ( 8 ) : 298 – 304 .
   Google Scholar
• King , R. F. 1973 . An improved Pegasus method for root finding . BIT , 13 ( 8 ) : 423 – 427 .
   Google Scholar
• King , R. F. 1973 . A family of fourth-order methods for nonlinear equations . SIAM J. Numer. Amal. , 10 ( 8 ) : 876 – 879 .
   Google Scholar
• King , R. F. 1976 . Methods without secant steps for finding a bracketed root . Computing , 17 ( 8 ) : 49 – 57 .
   Google Scholar
• Kiss , I. 1954 . Uber eine arallgemeinerung des Newtonschen Naherungsfahren . Z. Angew. Math. Mech. , 34 ( 8 ) : 68 – 69 .
   Google Scholar
• Kulik , S. 1959 . On the solution of algebraic equations . Proc. Amer. Math. Soc. , 10 ( 8 ) : 185 – 192 .
   Google Scholar
• Kung , H. T. and Traub , J. F. 1974 . Optimal order of one-point and multipoint iterations . J. Assoc. Comput. Mach. , 21 ( 8 ) : 643 – 651 .
   Google Scholar
• Kung , H. and Traub , J. F. 1976 . Optimal order and efficiency for iterations with two evaluations . SIAM J. Numer. Anal. , 13 ( 8 ) : 84 – 99 .
   Google Scholar
• Laguerre , E. N. Oeuvres de Laguerre , 1 ( 8 ) 87 – 103 .
   Google Scholar
• Laguerre , E. N. 1880 . Sur une methode pour obtener par approximation les racines d'une equation algebrique qui a toutes ses racines reelles . Nouvelles Ann. de Math. 2e series , 19 ( 8 ) : 88 – 103 .
   Google Scholar
• Lika , D. K. 1965 . Abstracts of papers read at the Second Scientific-Tech. Republ. Conf . Iteration methods of high order . 1965 , Kishinev, Moldavia. pp. 13 – 16 .
   Google Scholar
• Lin , S. 1943 . A method of finding roots of algebraic equations . J. Math, and Phys. , 22 : 60 – 77 . now Studies in Appi Math.
   Google Scholar
• Milovanovic , G. V. and Djordjevic , Dj. R. 1980 . Proc. 4th Bos. -Herc. Symp. on Informatics, Jahorina . The solution of non-linear equations using iterative processes derived from exponential approximation . March 24-28 1980 . pp. 465 1 – 465. 5 . Serbo-Croatian
   Google Scholar
• Muller , D. E. 1956 . A method for solving algebraic equations using an automatic computer . Math. Comp. , 10 March : 208 – 215 .
   Google Scholar
• Murakami , T. 1978 . Some fifth-order multipoint iterative formulae for solving equations . J. of Information Processing , 1 March : 138 – 139 .
   Google Scholar
• Nerinckx , D. and Haegemans , A. 1976 . A comparison of non-linear equation solvers . J. Comp. Appl. Math. , 2 March : 145 – 148 .
   Google Scholar
• Nesdore , P. F. 1970 . “ The determination of an algorithm which uses the mixed strategy technique for the solution of single nonlinear equations ” . In Numerical Methods for Nonlinear Algebraic Equations , Edited by: Rabinowitz , Ph. London : Gordon and Breach .
   Google Scholar
• Neta , B. 1979 . A sixth-order family of methods for nonlinear equations . Intern. J. Computer Math. , 7 : 157 – 161 .
   Web of Science ®Google Scholar
• Neta , B. 1981 . On a family of multipoint methods for nonlinear equations . Intern. J. Computer Math. , 9 : 353 – 361 .
   Web of Science ®Google Scholar
• Neta , B. 1983 . A new family of higher order methods for solving equations . Intern. J. Computer Math. , 14 : 191 – 195 .
   Web of Science ®Google Scholar
• Nourein , A. W. M. 1976 . Root determination by use of Pade approximants . BIT , 16 : 291 – 297 .
   Google Scholar
• Ostrowski , A. M. 1964 . On approximation of equations by algebraic equations . SIAM J. Numer. Anal. , 1 : 104 – 130 .
   Google Scholar
• Ostrowski , A. M. 1973 . Solution of Equations and Systems of Equations , New York : Academic Press . London
   Google Scholar
• Popovski , D. B. 1979 . A hybrid algorithm for finding roots . Informatica , 3 : 16 – 17 .
   Google Scholar
• Popovski , D. B. 1979 . A Fortran IV subroutine for finding a bracketed root . Informatica , 4 : 23 – 24 .
   Google Scholar
• Popovski , D. B. 1979 . A root finding algorithm . Prilozi , 30-31 : 289 – 293 .
   Google Scholar
• Popovski , D. B. 1979 . Proc. 14th Yug. Symp. on Information ProcessingInformatica . Solution of equations on the basis of one-point logarithmic approximation . October 1-6 1979 .
   Google Scholar
• Popovski , D. B. 1979 . Numerical solution of equations on the basis of approxi mation by the curve (x − p1)[y(x) − p2]2 − p3 = 0 . Int. J. Num. Math. Engng. , 14 October
   Google Scholar
• Popovski , D. B. and Popovski , P. B. 1980 . Proc. 4th Bos. -Herc. Symp. on Informatics . On Jarratt's two-point method for finding roots . March 24-28 1980 . pp. 413. 1 – 413. 5 . Jahorina
   Google Scholar
• Popovski , D. B. 1980 . Hybrid Chambers-bisection algorithm for finding a bracketed root . Contributions , 32-33 March : 109 – 113 . Society of Sciences and Art—Bitola, Yugoslavia
   Google Scholar
• Popovski , D. B. 1980 . A family of one-point iteration formulae for finding roots . Intern. J. Computer Math. , 8 March : 85 – 88 .
   Web of Science ®Google Scholar
• Popovski , D. B. 1980 . An extension of Chebyshev's iteration . Informatica , 4 March : 26 – 28 .
   Google Scholar
• Popovski , D. B. 1980 . On an algorithm for finding function zeros . Informatica , 1 March : 47 – 48 . Serbo-Croatian
   Google Scholar
• Popovski , D. B. 1980 . On a subroutine for root finding . Informatica , 3 March : 23 – 24 .
   Google Scholar
• Popovski , D. B. 1981 . A method for solving equations . Informatica , 1 March : 212 – 213 .
   Google Scholar
• Popovski , D. B. 1981 . Method of parabolic approximation for solving the equation x = f(x) . Intern. J. Computer Math. , 9 March : 243 – 248 .
   Web of Science ®Google Scholar
• Popovski , D. B. 1981 . An improvement of the Ostrowski root finding method . Z. Angew. Math. Mech. , 61 March : T303 – T305 .
   Google Scholar
• Popovski , D. B. 1981 . Proc. 3rd Int. Symp.—Computers at the University . Method of tangential hyperbolic approximation for solving equations . May 25-28 1981 , Cavtat. pp. 311. 1 – 311. 6 .
   Google Scholar
• Popovski , D. B. 1981 . A note on King's fifth order family of methods for solving equations . BIT , 21 May : 129 – 130 .
   Google Scholar
• Popovski D. B. Proc. College of Engineering Yugoslavia 1981 79 83
   Google Scholar
• Popovski , D. B. 1981 . A method for solving equations . Informatica , 1 May : 212 – 213 .
   Google Scholar
• Popovski , D. B. 1981 . A note on Neta's family of sixth-order methods for solving equations . Intern. J. Computer Math. , 10 May : 91 – 93 .
   Web of Science ®Google Scholar
• Popovski , D. B. 1982 . Proc. 4th Int. Symp.—Computer at the University . A class of two-step methods for solving equations . May 24-28 1982 . pp. 487 – 491 . Cavtat
   Google Scholar
• Popovski , D. B. 1982 . Sixth order methods for solving equations . J. Appl. Math. Phys (ZAMP) , 33 May : 434 – 438 .
   Google Scholar
• Popovski , D. B. and Popovski , P. B. 1982 . Some new one-point iteration functions of order three for solving equations . Z. Angew. Math. Mech. , 62 May : T344 – T345 .
   Google Scholar
• Popovski , D. B. 1982 . A note on King's method F for finding a bracketed root . Computing , 29 May : 355 – 359 .
   Google Scholar
• Putzer , E. J. 1962 . A numerical method for solving scalar equations . Amer. Math. Monthly , 69 May : 408 – 411 .
   Google Scholar
• Renyi , A. 1950 . On Newton's method of approximation . Mat. Lapok , 1 May : 278 – 293 . Hungarian
   Google Scholar
• Richmond , H. W. 1944 . On certain formulae for numerical approximation . J. London Math. Soc. , 19 May : 31 – 38 .
   Google Scholar
• Rissanen , J. 1971 . On optimum root-finding algorithms . J. Math. Anal. Appl. , 36 May : 220 – 225 .
   Google Scholar
• Salehov , G. S. 1952 . On the convergence of the process of tangent hyperbolas . Doklady Akad. Nauk SSSR , 82 May : 525 – 528 . Russian
   Google Scholar
• Schroder , E. 1870 . Uber unendlich viele Algorithmen zur Auflosung der Gleichungen . Math. Ann. , 2 May : 317 – 365 .
   Google Scholar
• Smith , B. T. 1967 . Proc. 1967 Army Numerical Analysis Conference . ZERPOL, a zero finding algorithm for polynomials using Laguerre's method . 1967 , Madison, WI. pp. 153 – 174 .
   Google Scholar
• J. N. Snyder Inverse interpolation, a real root of f(x) = 0 ILLIAC I Library Routine H1-71 University of Illinois Digital Computer Laboratory 1953 4
   Google Scholar
• Snyder , R. W. 1955 . One more correction formula . Amer. Math. Monthly , 62 : 722 – 725 .
   Google Scholar
• Steffensen , J. F. 1934 . Remarks on iteration . Skand. Aktuar. Tidskr. , 16 : 64 – 64 .
   Google Scholar
• Stewart , J. K. 1951 . Another variation of Newton's method . Amer. Math. Monthly , 58 : 331 – 334 .
   Google Scholar
• Stone , W. M. 1953 . A form of Newton's method with cubic convergence . Quart. Appl. Math. , 11 : 118 – 119 .
   Google Scholar
• Traub , J. F. 1961 . 16th National Assoc. Comput. Mach. Conference . On functional iteration and calculation of roots . 1961 .
   Google Scholar
• Traub , J. F. 1961 . On a class of iteration formulas and some historical notes . Comm. Assoc. Comput. Mach. , 4 ( 6 ) : 276 – 278 .
   Web of Science ®Google Scholar
• Traub , J. F. . The theory of multipoint iteration functions . Digest of Technical Papers, Assoc. Comput. Mach., National Conference . 1962 . pp. 80 – 81 .
   Google Scholar
• Traub , J. F. 1964 . Iterative Methods for the Solution of Equations , New York : Prentice-Hall .
   Google Scholar
• Varyukhin , V. A. and Kas' yanyuk , S. A. 1969 . Iterative methods of determining the roots of equations more accurately . USSR Comp. Math. & Math. Phys. , 9 : 247 – 252 .
   Google Scholar
• Varyukhin , V. A. and Kas' yanyuk , S. A. 1977 . Iterative methods of determining the roots of equations more accurately . USSR Comp. Math. & Math. Phys. , 9 : 215
   Google Scholar
• Victory , H. D. and Neta , B. 1983 . A higher order method for multiple zeros of nonlinear functions . Intern. J. Computer Math. , 12 : 329 – 335 .
   Web of Science ®Google Scholar
• Wall , H. S. 1948 . A modification of Newton's method . Amer. Math. Monthly , 55 : 90 – 94 .
   Google Scholar