{"title":"解联立非线性方程","authors":"K. Brown, S. D. Conte","doi":"10.1145/800196.805981","DOIUrl":null,"url":null,"abstract":"In this paper we present an algorithm for the numerical solution of (1.1) which is quadratically convergent and requires only (N2/2 + 3N/2) function evaluations per iterative step as compared with (N2 + N) evaluations for Newton's Method. Brown [1] has formalized the algorithm in terms of an iteration function [1, pp. 8-9] and proved that the method converges locally and that the convergence is quadratic in nature [1, pp. 21-32]. Computer results, obtained by applying an ALGOL procedure based on the method to some specific nonlinear systems, are included and a comparison is made with some of the better recent methods as well as with the classical Newton's Method; these results illustrate the quadratic convergence of the method.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"The solution of simultaneous nonlinear equations\",\"authors\":\"K. Brown, S. D. Conte\",\"doi\":\"10.1145/800196.805981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present an algorithm for the numerical solution of (1.1) which is quadratically convergent and requires only (N2/2 + 3N/2) function evaluations per iterative step as compared with (N2 + N) evaluations for Newton's Method. Brown [1] has formalized the algorithm in terms of an iteration function [1, pp. 8-9] and proved that the method converges locally and that the convergence is quadratic in nature [1, pp. 21-32]. Computer results, obtained by applying an ALGOL procedure based on the method to some specific nonlinear systems, are included and a comparison is made with some of the better recent methods as well as with the classical Newton's Method; these results illustrate the quadratic convergence of the method.\",\"PeriodicalId\":257203,\"journal\":{\"name\":\"Proceedings of the 1967 22nd national conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1967-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1967 22nd national conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800196.805981\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1967 22nd national conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800196.805981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we present an algorithm for the numerical solution of (1.1) which is quadratically convergent and requires only (N2/2 + 3N/2) function evaluations per iterative step as compared with (N2 + N) evaluations for Newton's Method. Brown [1] has formalized the algorithm in terms of an iteration function [1, pp. 8-9] and proved that the method converges locally and that the convergence is quadratic in nature [1, pp. 21-32]. Computer results, obtained by applying an ALGOL procedure based on the method to some specific nonlinear systems, are included and a comparison is made with some of the better recent methods as well as with the classical Newton's Method; these results illustrate the quadratic convergence of the method.