Computer Geometries for Finding All Real Zeros of Polynomial Equations Simultaneously
作者机构：Department of MathematicsNUMLIslamabad44000Pakistan Centre for Advanced Studies in Pure&Applied MathematicsBahauddin Zakariya UniversityMultan Department of Mathematics and StatisticsRiphah International University I-14Islamabad44000Pakistan
出 版 物：《Computers, Materials & Continua》 (计算机、材料和连续体（英文）)
年 卷 期：2021年第69卷第11期
页 面：2635-2651页
核心收录：
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题：Polynomials simultaneous iterative methods random initial guesses lower bound local computational order CAS-mathematica and mat lab
摘 要：In this research article,we construct a family of derivative free simultaneous numerical schemes to approximate all real zero of non-linear polynomial *** make a comparative analysis of the newly constructed numerical schemes with a well-known existing simultaneous method for determining all the distinct real zeros of polynomial equations using computer algebra system Mat *** bound of convergence of simultaneous schemes is calculated using *** convergence property of the numerical schemes is presented by taking random starting initial approximation and their convergence history are graphically *** real life engineering applications along with some higher degree polynomials are considered as numerical test problems to show performance and efficiency of the derivative free family of numerical methods with comparison of an existing method of same order in *** computational order of convergence,CPU time,graph of computational order of convergence and residual error graphs elaborate efficiency,robustness and authentication of the suggested family of numerical methods in its domain.
维普期刊数据库
