Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives

Simple item page
dc.contributor.authorH. BOYACI
dc.contributor.authorM. PAKDEMİRLİ
dc.contributor.authorH. A. YURTSEVER
dc.date.accessioned2025-04-14T05:53:23Z
dc.date.available2025-04-14T05:53:23Z
dc.date.issued2007
dc.description.abstractPerturbation theory is systematically used to generate root finding algorithms with fourth order derivatives. Depending on the number of correction terms in the perturbation expansion and the number of Taylor expansion terms, different root finding formulas can be generated. Expanding Taylor series up to fourth order derivatives and taking two, three and four correction terms in the perturbation expansions, three different root finding algorithms are derived. The algorithms are contrasted numerically with each other as well as with the Newton-Raphson algorithm. It is found that the quadruple-correction-term algorithm performs better than the others.
dc.identifier.urihttp://hdl.handle.net/20.500.14701/56064
dc.language.isoİngilizce
dc.subjectBilgisayar Bilimleri
dc.subjectYazılım Mühendisliği
dc.titlePerturbative derivation and comparisons of root-finding algorithms with fourth order derivatives

Files

Collections

TR-Dizin Koleksiyonu