ON NEWTON-RAPHSON METHOD

Mircea Cirnu and Irina Badralexi
Additional contact information
Mircea Cirnu: University “Politehnica” Of Bucharest
Irina Badralexi: University “Politehnica” Of Bucharest

Journal of Information Systems & Operations Management, 2011, vol. 5, issue 1, 91-94

Abstract: Recent versions of the well-known Newton-Raphson method for solving algebraic equations are presented. First of these is the method given by J. H. He in 2003. He reduces the problem to solving a second degree polynomial equation. However He’s method is not applicable when this equation has complex roots. In 2008, D. Wei, J. Wu and M. Mei eliminated this deficiency, obtaining a third order polynomial equation, which has always a real root. First of the authors of present paper obtained higher order polynomial equations, which for orders 2 and 3 are reduced to equations given by He and respectively by Wei-Wu-Mei, with much improved form. In this paper, we present these methods. An example is given.

Keywords: newton-raphson (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.rebe.rau.ro/RePEc/rau/jisomg/SP11/JISOM-SP11-A9.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rau:jisomg:v:5:y:2011:i:1:p:91-94

Access Statistics for this article

More articles in Journal of Information Systems & Operations Management from Romanian-American University Contact information at EDIRC.
Bibliographic data for series maintained by Alex Tabusca ().