New Third Order Nonlinear Solvers for Multiple Roots (uncorrected proof)

dc.contributor.author	Neta, Beny
dc.date	2008
dc.date.accessioned	2014-03-12T22:47:49Z
dc.date.available	2014-03-12T22:47:49Z
dc.date.issued	2008
dc.identifier.uri	https://hdl.handle.net/10945/39430
dc.description	Applied Mathematics and Computation, 202, (2008), 162–170, doi:10.1016/j.amc.2008.01.031.	en_US
dc.description	The article of record as published may be located at http://dx.doi.org/10.1016/j.amc.2008.01.031	en_US
dc.description.abstract	Two third order methods for finding multiple zeros of nonlinear functions are developed. One method is based on Chebyshev’s third order scheme (for simple roots) and the other is a family based on a variant of Chebyshev’s which does not require the second derivative. Two other more efficient methods of lower order are also given. These last two methods are variants of Chebyshev’s and Osada’s schemes. The informational efficiency of the methods is discussed. All these methods require the knowledge of the multiplicity.	en_US
dc.rights	This 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.title	New Third Order Nonlinear Solvers for Multiple Roots (uncorrected proof)	en_US
dc.contributor.department	Applied Mathematics	en_US
dc.subject.author	Nonlinear equations; High order; Multiple roots; Fixed point; Chebyshev; Osada	en_US

Related items