Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives
| dc.contributor.author | H. BOYACI | |
| dc.contributor.author | M. PAKDEMİRLİ | |
| dc.contributor.author | H. A. YURTSEVER | |
| dc.date.accessioned | 2024-07-24T09:11:17Z | |
| dc.date.available | 2024-07-24T09:11:17Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Perturbation 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.issn | 1300-686X | |
| dc.identifier.uri | http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/23591 | |
| dc.language.iso | eng | |
| dc.subject | [Fen > Temel Bilimler > Matematik] | |
| dc.title | Perturbative derivation and comparisons of root-finding algorithms with fourth order derivatives | |
| dc.type | Araştırma Makalesi |