{"title":"求标量非线性方程单根的最优八阶多点数值迭代法","authors":"M. Z. Ullah","doi":"10.52280/pujm.2022.541103","DOIUrl":null,"url":null,"abstract":"An optimal eighth-order multipoint numerical iterative method is constructed to find the\nsimple root of scalar nonlinear equations. It is a three-point numerical iterative method that uses three evaluations of func-tion f(¢) associated with a scalar nonlinear equation and one of its deriv-atives f0 (¢). The four functional evaluations are required to achieve the eighth-order convergence. According to Kung-Traub conjecture (KTC), an iterative numerical multipoint method without memory can achieve maximum order of convergence 2n¡1 where n is the total number of func-tion evaluations in a single instance of the method. Therefore, following the KTC, the proposed method in this article is\noptimal.","PeriodicalId":205373,"journal":{"name":"Punjab University Journal of Mathematics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An optimal eighth-order multipoint numerical iterative method to find simple root of\\nscalar nonlinear equations\",\"authors\":\"M. Z. Ullah\",\"doi\":\"10.52280/pujm.2022.541103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal eighth-order multipoint numerical iterative method is constructed to find the\\nsimple root of scalar nonlinear equations. It is a three-point numerical iterative method that uses three evaluations of func-tion f(¢) associated with a scalar nonlinear equation and one of its deriv-atives f0 (¢). The four functional evaluations are required to achieve the eighth-order convergence. According to Kung-Traub conjecture (KTC), an iterative numerical multipoint method without memory can achieve maximum order of convergence 2n¡1 where n is the total number of func-tion evaluations in a single instance of the method. Therefore, following the KTC, the proposed method in this article is\\noptimal.\",\"PeriodicalId\":205373,\"journal\":{\"name\":\"Punjab University Journal of Mathematics\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Punjab University Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52280/pujm.2022.541103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Punjab University Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52280/pujm.2022.541103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An optimal eighth-order multipoint numerical iterative method to find simple root of
scalar nonlinear equations
An optimal eighth-order multipoint numerical iterative method is constructed to find the
simple root of scalar nonlinear equations. It is a three-point numerical iterative method that uses three evaluations of func-tion f(¢) associated with a scalar nonlinear equation and one of its deriv-atives f0 (¢). The four functional evaluations are required to achieve the eighth-order convergence. According to Kung-Traub conjecture (KTC), an iterative numerical multipoint method without memory can achieve maximum order of convergence 2n¡1 where n is the total number of func-tion evaluations in a single instance of the method. Therefore, following the KTC, the proposed method in this article is
optimal.