{"title":"求解非线性方程组的不精确双步长方法","authors":"A. Halilu, M. Waziri, Y. B. Musa","doi":"10.19139/soic-2310-5070-532","DOIUrl":null,"url":null,"abstract":"In this paper, a single direction with double step length method for solving systems of nonlinear equations is presented. Main idea used in the algorithm is to approximate the Jacobian via acceleration parameter. Furthermore, the two step lengths are calculated using inexact line search procedure. This method is matrix-free, and so is advantageous when solving large-scale problems. The proposed method is proven to be globally convergent under appropriate conditions. The preliminary numerical results reported in this paper using a large-scale benchmark test problems show that the proposed method is practically quite effective.","PeriodicalId":93376,"journal":{"name":"Statistics, optimization & information computing","volume":"8 1","pages":"165-174"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Inexact Double Step Length Method For Solving Systems Of Nonlinear Equations\",\"authors\":\"A. Halilu, M. Waziri, Y. B. Musa\",\"doi\":\"10.19139/soic-2310-5070-532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a single direction with double step length method for solving systems of nonlinear equations is presented. Main idea used in the algorithm is to approximate the Jacobian via acceleration parameter. Furthermore, the two step lengths are calculated using inexact line search procedure. This method is matrix-free, and so is advantageous when solving large-scale problems. The proposed method is proven to be globally convergent under appropriate conditions. The preliminary numerical results reported in this paper using a large-scale benchmark test problems show that the proposed method is practically quite effective.\",\"PeriodicalId\":93376,\"journal\":{\"name\":\"Statistics, optimization & information computing\",\"volume\":\"8 1\",\"pages\":\"165-174\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Statistics, optimization & information computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19139/soic-2310-5070-532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Statistics, optimization & information computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19139/soic-2310-5070-532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Inexact Double Step Length Method For Solving Systems Of Nonlinear Equations
In this paper, a single direction with double step length method for solving systems of nonlinear equations is presented. Main idea used in the algorithm is to approximate the Jacobian via acceleration parameter. Furthermore, the two step lengths are calculated using inexact line search procedure. This method is matrix-free, and so is advantageous when solving large-scale problems. The proposed method is proven to be globally convergent under appropriate conditions. The preliminary numerical results reported in this paper using a large-scale benchmark test problems show that the proposed method is practically quite effective.