Show simple item record

dc.contributor.authorScott, Melvin
dc.contributor.authorNeta, Beny
dc.contributor.authorChun, Changbum
dc.date2011
dc.date.accessioned2014-03-12T22:47:49Z
dc.date.available2014-03-12T22:47:49Z
dc.date.issued2011
dc.identifier.urihttps://hdl.handle.net/10945/39427
dc.descriptionApplied Mathematics and Computation, 218, (2011), 2584–2599.en_US
dc.descriptionThe article of record as published may be located at http://dx.doi.org/10.1016/j.amc.2011.07.076.en_US
dc.description.abstractThere are many methods for the solution of a nonlinear algebraic equation. The methods are classified by the order, informational efficiency and efficiency index. Here we consider other criteria, namely the basin of attraction of the method and its dependence on the order. We discuss several methods of various orders and present the basin of attraction for several examples. It can be seen that not all higher order methods were created equal. Newton’s, Halley’s, Murakami’s and Neta–Johnson’s methods are consistently better than the others. In two of the examples Neta’s 16th order scheme was also as good.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleBasin attractors for various methodsen_US
dc.contributor.departmentApplied Mathematicsen_US
dc.subject.authorBasin of attractionen_US
dc.subject.authorIterative methodsen_US
dc.subject.authorSimple rootsen_US
dc.subject.authorNonlinear equationsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record