메뉴 건너뛰기




Volumn 231, Issue 1, 2009, Pages 249-254

On Newton-type methods for multiple roots with cubic convergence

Author keywords

Chebyshev method; Halley method; Multiple roots; Newton method; Newton type methods; Rootfinding

Indexed keywords

CHEBYSHEV METHOD; HALLEY METHOD; MULTIPLE ROOTS; NEWTON METHOD; NEWTON-TYPE METHODS; ROOTFINDING;

EID: 67349144709     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2009.02.006     Document Type: Article
Times cited : (31)

References (14)
  • 1
    • 41049084738 scopus 로고
    • A family of multipoint iterative functions for finding multiple roots of equations
    • Dong C. A family of multipoint iterative functions for finding multiple roots of equations. Int. J. Comput. Math. 21 (1987) 363-367
    • (1987) Int. J. Comput. Math. , vol.21 , pp. 363-367
    • Dong, C.1
  • 2
    • 0003275962 scopus 로고
    • A family of root finding methods
    • Hansen E., and Patrick M. A family of root finding methods. Numer. Math. 27 (1977) 257-269
    • (1977) Numer. Math. , vol.27 , pp. 257-269
    • Hansen, E.1    Patrick, M.2
  • 3
    • 0032625793 scopus 로고    scopus 로고
    • A modification of Newton's method for analytic mappings having multiple zeros
    • Kravanja P., and Haegemans A. A modification of Newton's method for analytic mappings having multiple zeros. Computing 62 (1999) 129-145
    • (1999) Computing , vol.62 , pp. 129-145
    • Kravanja, P.1    Haegemans, A.2
  • 4
    • 0020708956 scopus 로고
    • A higher order method for multiple zeros of nonlinear functions
    • Victory H.D., and Neta B. A higher order method for multiple zeros of nonlinear functions. Int. J. Comput. Math. 12 (1983) 329-335
    • (1983) Int. J. Comput. Math. , vol.12 , pp. 329-335
    • Victory, H.D.1    Neta, B.2
  • 5
    • 34447609127 scopus 로고
    • Über unendlich viele Algorithmen zur Auflösung der Gleichungen
    • Schröder E. Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann. 2 (1870) 317-365
    • (1870) Math. Ann. , vol.2 , pp. 317-365
    • Schröder, E.1
  • 8
    • 0041841198 scopus 로고    scopus 로고
    • Ten methods to bound multiple roots of polynomials
    • Rump S.M. Ten methods to bound multiple roots of polynomials. J. Comput. Appl. Math. 156 (2003) 403-432
    • (2003) J. Comput. Appl. Math. , vol.156 , pp. 403-432
    • Rump, S.M.1
  • 9
    • 38149146256 scopus 로고
    • An optimal multiple root-finding method of order three
    • Osada N. An optimal multiple root-finding method of order three. J. Comput. Appl. Math. 51 (1994) 131-133
    • (1994) J. Comput. Appl. Math. , vol.51 , pp. 131-133
    • Osada, N.1
  • 10
    • 33746257614 scopus 로고    scopus 로고
    • Asymptotic error constants of cubically convergent zero finding methods
    • Osada N. Asymptotic error constants of cubically convergent zero finding methods. J. Comput. Appl. Math. 196 (2006) 347-357
    • (2006) J. Comput. Appl. Math. , vol.196 , pp. 347-357
    • Osada, N.1
  • 11
    • 34247360860 scopus 로고    scopus 로고
    • A one parameter family of locally quartically convergent zero-finding methods
    • Osada N. A one parameter family of locally quartically convergent zero-finding methods. J. Comput. Appl. Math. 205 (2007) 116-128
    • (2007) J. Comput. Appl. Math. , vol.205 , pp. 116-128
    • Osada, N.1
  • 12
    • 41949096396 scopus 로고    scopus 로고
    • Chebyshev-Halley methods for analytic functions
    • Osada N. Chebyshev-Halley methods for analytic functions. J. Comput. Appl. Math. 216 (2008) 585-599
    • (2008) J. Comput. Appl. Math. , vol.216 , pp. 585-599
    • Osada, N.1
  • 13
    • 0041840554 scopus 로고    scopus 로고
    • Modified Newton's method with third-order convergence and multiple roots
    • Frontini M., and Sormani E. Modified Newton's method with third-order convergence and multiple roots. J. Comput. Appl. Math. 156 (2003) 345-354
    • (2003) J. Comput. Appl. Math. , vol.156 , pp. 345-354
    • Frontini, M.1    Sormani, E.2
  • 14
    • 0001050260 scopus 로고
    • Methodus nova accurata & facilis inveniendi radices aequationum quarumcumque genereliter, sine praevia reductionei
    • Halley E. Methodus nova accurata & facilis inveniendi radices aequationum quarumcumque genereliter, sine praevia reductionei. Philos. Trans. Roy. Soc. London 18 (1694) 136-148
    • (1694) Philos. Trans. Roy. Soc. London , vol.18 , pp. 136-148
    • Halley, E.1


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