Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/5931
DC FieldValueLanguage
dc.contributor.authorRalević, Nebojšaen
dc.contributor.authorĆebić D.en
dc.date.accessioned2019-09-30T08:51:20Z-
dc.date.available2019-09-30T08:51:20Z-
dc.date.issued2015-11-25en
dc.identifier.issn13925113en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/5931-
dc.description.abstract© Vilnius University, 2016. This paper deals with the problem of determining the multiple roots of nonlinear equations, where the multiplicity of the roots is known. The paper contains some remarks on the optimality of the recently published methods [B. Liu, X. Zhou, A new family of fourth-order methods for multiple roots of nonlinear equations, Nonlinear Anal. Model. Control, 18(2):143-152, 2013] and [X. Zhou, X. Chen, Y. Song, Families of third-and fourth-order methods for multiple roots of nonlinear equations, Appl. Math. Comput., 219(11):6030-6038, 2013]. Separate analysis of odd and even multiplicity, has shown the cases where those methods lose their optimal convergence properties. Numerical experiments are made and they support theoretical analysis.en
dc.relation.ispartofNonlinear Analysis: Modelling and Controlen
dc.titleOn the optimality of some multi-point methods for finding multiple roots of nonlinear equationen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.15388/NA.2016.1.9en
dc.identifier.scopus2-s2.0-84948958962en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84948958962en
dc.relation.lastpage134en
dc.relation.firstpage121en
dc.relation.issue1en
dc.relation.volume21en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptFakultet tehničkih nauka, Departman za opšte discipline u tehnici-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

Page view(s)

17
Last Week
7
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.