Optima leighth-order multiple root finding iterative methods using bi variate weight function

Simple item page
dc.contributor.authorRajni, Sharma
dc.contributor.authorAshu Bahl
dc.contributor.authorRanjita Guglani
dc.date.accessioned2026-02-17T05:36:20Z
dc.date.available2026-02-17T05:36:20Z
dc.date.issued2023
dc.description.abstractInthiscontribution, anovel eighth-order scheme ispresentedfor solvingnonlinearequations withmultipleroots.Theproposedschemecomprisesof threestepswiththemodifiedNewton methodas its first stepfollowedbytwoweightedNewtonsteps involvingoneunivariateand onebivariatefunctionrespectively.Analysisofconvergenceconfirmsthatthepresentedscheme obtains optimal computational order of convergence. The efficiencyof presented scheme is comparednumericallywith recent eighth-ordermethods. Functions like populationgrowth problem,Newton’sbeamproblem, etc.,havebeenconsideredfornumerical experimentation. For the comparative study in the complex plane, we employed the concept of basins of attraction
dc.identifier.issnhttps://doi.org/10.1016/j.rico.2023.100270
dc.identifier.urihttp://davjalandhar.ndl.gov.in/handle/123456789/209
dc.language.isoen
dc.publisherElsevierB.V
dc.titleOptima leighth-order multiple root finding iterative methods using bi variate weight function
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Optimaleighth-ordermultiplerootfindingiterativemethodsusing.htm
Size:
62.36 KB
Format:
Hypertext Markup Language
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Research Articles