메뉴 건너뛰기




Volumn 5, Issue 1, 1996, Pages 329-359

On the Lambert W function

Author keywords

[No Author keywords available]

Indexed keywords


EID: 21444436092     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02124750     Document Type: Article
Times cited : (5823)

References (23)
  • 1
    • 0001717185 scopus 로고
    • On the convergence of Halley's method
    • G. Alefeld, On the convergence of Halley's method, Amer. Math. Monthly 88 (1981) 530-536.
    • (1981) Amer. Math. Monthly , vol.88 , pp. 530-536
    • Alefeld, G.1
  • 2
    • 0003589319 scopus 로고
    • ANSI/IEEE Std 754-1985, New York
    • American National Standards Institute/Institute of Electrical and Electronic Engineers: IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Std 754-1985, New York (1985).
    • (1985) IEEE Standard for Binary Floating-Point Arithmetic
  • 10
    • 0011497784 scopus 로고
    • Ueber eine der Interpolation entsprechende Darstellung der Eliminations- Resultante
    • C.W. Borchardt, Ueber eine der Interpolation entsprechende Darstellung der Eliminations- Resultante, J. reine angewandte Math. 57 (1860) 111-121.
    • (1860) J. Reine Angewandte Math. , vol.57 , pp. 111-121
    • Borchardt, C.W.1
  • 17
    • 27844509912 scopus 로고    scopus 로고
    • private communication
    • D. Coppersmith, private communication.
    • Coppersmith, D.1
  • 18
    • 0012500963 scopus 로고
    • What good are numerical simulations of chaotic dynamical systems?
    • R.M. Corless, What good are numerical simulations of chaotic dynamical systems?, Computers Math. Applic. 28 (1994) 107-121.
    • (1994) Computers Math. Applic. , vol.28 , pp. 107-121
    • Corless, R.M.1
  • 20
    • 2342496727 scopus 로고
    • Well, It Isn't Quite That Simple
    • R.M. Corless and D.J. Jeffrey, Well, It Isn't Quite That Simple, SIGSAM Bulletin 26 (3) (1992) 2-6.
    • (1992) SIGSAM Bulletin , vol.26 , Issue.3 , pp. 2-6
    • Corless, R.M.1    Jeffrey, D.J.2
  • 23
    • 0022754664 scopus 로고
    • A note on the height of binary search trees
    • L. Devroye, A note on the height of binary search trees, J. ACM 33 (1986) 489-498.
    • (1986) J. ACM , vol.33 , pp. 489-498
    • Devroye, L.1


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