Dynamics of some one-point third-order methods for the solution of nonlinear equations
MetadataShow full item record
In this paper we have considered 32 one-point methods of cubic order to obtain simple zeros of a nonlinear function. These schemes are constructed by decomposition of previously known schemes. We have used the idea of basins of attractions to compare the performance of these methods with Halley's method on 4 polynomial functions and one non-polynomial function. Based on 3 quantitative criteria, namely average number of iterations per point, CPU time required and the number of points for which the method diverge, we have found 4 methods that performed close to best. We also show that decomposing good methods does not necessarily lead to a better one or even to a scheme as good as the original. We found only one example that gave reasonable results and it is the only one with repelling extraneous fixed points on the imaginary axis.
The article of record as published may be found at https://doi.org/10.5899/2018/cna-00362
Showing items related by title, author, creator and subject.
Arnason, G.; Haltiner, G.J.; Frawley, M.J. (1962-05);Two iterative methods are described for obtaining horizontal winds from the pressure-height field by means of higher-order geostrophic approximations for the purpose of improving upon the geostrophic wind. The convergence ...
Exponential leap-forward gradient scheme for determining the isothermal layer depth from profile data Chu, P.C.; Fan, C.W. (Springer, 2017);Two distinct layers usually exist in the upper ocean. The rst has a near-zero vertical gradient in temperature (or density) from the surface and is called the iso-thermal layer (or mixed layer). Beneath that is a layer ...
Kelly, J.F.; Giraldo, Francis X.; Constantinescu, E.M. (2013);We derive an implicit-explicit (IMEX) formalism for the three-dimensional Euler equations that allow a unified representation of various nonhydrostatic flow regimes, including cloud-resolving and mesoscale (flow in a 3D ...