{"title":"A new optimal iterative algorithm for solving nonlinear equations","authors":"Dhyan R. Gorashiya, Rajesh C. Shah","doi":"10.59400/jam.v2i1.477","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to propose a new iterative algorithm (scheme or method) for solving algebraic and transcendental equations considering fixed point and an initial guess value on the x-axis. The concepts of slope of a line and Taylor series are used in the derivation. The algorithm has second-order convergence and requires two function evaluations in each step, which shows that it is optimal with computational efficiency index 1.414 and informational efficiency 1. The validity of the algorithm is examined by solving some examples and their comparisons with the Newton’s method.","PeriodicalId":504292,"journal":{"name":"Journal of AppliedMath","volume":"76 16","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of AppliedMath","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.59400/jam.v2i1.477","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The aim of this paper is to propose a new iterative algorithm (scheme or method) for solving algebraic and transcendental equations considering fixed point and an initial guess value on the x-axis. The concepts of slope of a line and Taylor series are used in the derivation. The algorithm has second-order convergence and requires two function evaluations in each step, which shows that it is optimal with computational efficiency index 1.414 and informational efficiency 1. The validity of the algorithm is examined by solving some examples and their comparisons with the Newton’s method.
本文旨在提出一种新的迭代算法(方案或方法),用于求解代数方程和超越方程,并考虑 x 轴上的定点和初始猜测值。在推导过程中使用了直线斜率和泰勒级数的概念。该算法具有二阶收敛性,每一步需要两次函数求值,这表明该算法是最优的,计算效率指数为 1.414,信息效率为 1。通过求解一些例子及其与牛顿法的比较,检验了该算法的有效性。