Skip navigation

Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12128/12705
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGdawiec, Krzysztof-
dc.contributor.authorShahid, Abdul Aziz-
dc.contributor.authorWaqas, Nazeer-
dc.date.accessioned2020-02-19T13:40:02Z-
dc.date.available2020-02-19T13:40:02Z-
dc.date.issued2020-
dc.identifier.citation"Mediterranean Journal of Mathematics" Vol. 17, art. no 43pl_PL
dc.identifier.issn1660-5446-
dc.identifier.urihttp://hdl.handle.net/20.500.12128/12705-
dc.description.abstractThere are many methods for solving a polynomial equation and many different modifications of those methods have been proposed in the literature. One of such modifications is the use of various iteration processes taken from the fixed point theory. In this paper, we propose a modification of the iteration processes used in the Basic Family of iterations by replacing the convex combination with an s-convex one. In our study, we concentrate only on the S-iteration with s-convexity. We present some graphical examples, the so-called polynomiographs, and numerical experiments showing the dependency of polynomiograph’s generation time on the value of the s parameter in the s-convex combination.pl_PL
dc.language.isoenpl_PL
dc.rightsUznanie autorstwa 3.0 Polska*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/pl/*
dc.subjectroot findingpl_PL
dc.subjects-iterationpl_PL
dc.subjects-convexitypl_PL
dc.subjectpolynomiographypl_PL
dc.titleHigher Order Methods of the Basic Family of Iterations via S-Iteration Scheme with s-Convexitypl_PL
dc.typeinfo:eu-repo/semantics/articlepl_PL
dc.identifier.doi10.1007/s00009-020-1491-y-
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Gdawiec_Higher_Order_Methods_Of_The_Basic_Family.pdf4,29 MBAdobe PDFView/Open
Show simple item record


Uznanie Autorstwa 3.0 Polska Creative Commons License Creative Commons