메뉴 건너뛰기




Volumn 116, Issue 1, 2000, Pages 195-200

Newton's method and generation of a determinantal family of iteration functions

Author keywords

65H05; Newton's method; Polynomial roots; Rootfinding

Indexed keywords

POLYNOMIALS; RECURSIVE FUNCTIONS; THEOREM PROVING;

EID: 0033880273     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(99)00361-1     Document Type: Article
Times cited : (23)

References (13)
  • 1
    • 0002836895 scopus 로고
    • Halley's method for solving equations
    • Bateman H. Halley's method for solving equations. Amer. Math. Monthly. 45:1938;11-17.
    • (1938) Amer. Math. Monthly , vol.45 , pp. 11-17
    • Bateman, H.1
  • 2
    • 0030406042 scopus 로고    scopus 로고
    • Accelerated convergence in Newton's method
    • Ford W.F., Pennline J.A. Accelerated convergence in Newton's method. SIAM Rev. 38:1996;658-659.
    • (1996) SIAM Rev. , vol.38 , pp. 658-659
    • Ford, W.F.1    Pennline, J.A.2
  • 3
    • 0028445851 scopus 로고
    • Accelerated convergence in Newton's method
    • Gerlach J. Accelerated convergence in Newton's method. SIAM Rev. 36:1994;272-276.
    • (1994) SIAM Rev. , vol.36 , pp. 272-276
    • Gerlach, J.1
  • 4
    • 0001050260 scopus 로고
    • A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction
    • Halley E. A new, exact, and easy method of finding roots of any equations generally, and that without any previous reduction. Philos. Trans. Roy. Soc. London. 18:1694;136-145.
    • (1694) Philos. Trans. Roy. Soc. London , vol.18 , pp. 136-145
    • Halley, E.1
  • 5
    • 0004967376 scopus 로고    scopus 로고
    • On the order of convergence of a determinantal family of root-finding methods
    • Kalantari B. On the order of convergence of a determinantal family of root-finding methods. BIT. 39:1999;96-109.
    • (1999) BIT , vol.39 , pp. 96-109
    • Kalantari, B.1
  • 6
    • 0039531837 scopus 로고    scopus 로고
    • Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas
    • Technical Report DCS-TR 328, Department of Computer Science, Rutgers University, New Brunswick, NJ, to be published in
    • B. Kalantari, Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas, Technical Report DCS-TR 328, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1997, to be published in J. Comput. Appl. Math.
    • (1997) J. Comput. Appl. Math.
    • Kalantari, B.1
  • 7
    • 0004958020 scopus 로고    scopus 로고
    • Approximation of polynomial root using a single input and the corresponding derivative values
    • Department of Computer Science, Rutgers University, New Brunswick, NJ
    • B. Kalantari, Approximation of polynomial root using a single input and the corresponding derivative values, Technical Report DCS-TR 369, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998.
    • (1998) Technical Report DCS-TR , vol.369
    • Kalantari, B.1
  • 8
    • 0342285470 scopus 로고    scopus 로고
    • Halley's method as the first member of an infinite family of cubic order rootfinding methods
    • Department of Computer Science, Rutgers University, New Brunswick, NJ
    • B. Kalantari, Halley's method as the first member of an infinite family of cubic order rootfinding methods, Technical Report DCS-TR 370, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998.
    • (1998) Technical Report DCS-TR , vol.370
    • Kalantari, B.1
  • 9
    • 0001295137 scopus 로고    scopus 로고
    • High order iterative methods for approximating square roots
    • Kalantari B., Kalantari I. High order iterative methods for approximating square roots. BIT. 36:1996;395-399.
    • (1996) BIT , vol.36 , pp. 395-399
    • Kalantari, B.1    Kalantari, I.2
  • 10
    • 0031554218 scopus 로고    scopus 로고
    • A basic family of iteration functions for polynomial root finding and its characterizations
    • Kalantari B., Kalantari I., Zaare-Nahandi R. A basic family of iteration functions for polynomial root finding and its characterizations. J. Comput. Appl. Math. 80:1997;209-226.
    • (1997) J. Comput. Appl. Math. , vol.80 , pp. 209-226
    • Kalantari, B.1    Kalantari, I.2    Zaare-Nahandi, R.3
  • 11
    • 14944351893 scopus 로고
    • On the geometry of Halley's method
    • Scavo T.R., Thoo J.B. On the geometry of Halley's method. Amer. Math. Monthly. 102:1995;417-426.
    • (1995) Amer. Math. Monthly , vol.102 , pp. 417-426
    • Scavo, T.R.1    Thoo, J.B.2
  • 13
    • 0029535607 scopus 로고
    • Historical development of Newton-Raphson method
    • Ypma T.J. Historical development of Newton-Raphson method. SIAM Rev. 37:1995;531-551.
    • (1995) SIAM Rev. , vol.37 , pp. 531-551
    • Ypma, T.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.