![]() |
Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 105
PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by:
Paper 32
Efficient Iterative Methods for Approximating Multiple Roots J.L. Hueso1, E. Martínez2 and C. Teruel1
1Instituto Universitario de Matemática Multidisciplinar, Universitat Politècnica de València, Spain
Full Bibliographic Reference for this paper
, "Efficient Iterative Methods for Approximating Multiple Roots", in , (Editors), "Proceedings of the Ninth International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 32, 2014. doi:10.4203/ccp.105.32
Keywords: nonlinear equations, iterative methods, convergence order, efficiency index, multiple root.
Summary
In this paper, we present a new family of iterative methods for approximating multiple
roots of nonlinear equations when the multiplicity is known. The methods are
optimal in Kung-Traub's sense, because only three functional values per iteration are
computed. The obtained methods are compared with existing optimal methods by
using some example equations that have multiple roots.
purchase the full-text of this paper (price £20)
go to the previous paper |
|