{"title":"基于最陡下降法求解非线性方程","authors":"Tianyou Zhang","doi":"10.1109/ICIC.2011.107","DOIUrl":null,"url":null,"abstract":"This paper concerns with the problem of solving non-linear equation. It is shown that solving non-linear equation is equivalent to the evaluation extremum of funtion. In terms of unconstrained optimization using steepest descent method, we propose an algorithm for solving non-linear equation. It is shown that the proposed algorithm has the same convergence rate as the secant method. Several numerical experiments are also provided to demonstrate the effect of the proposed algorithm.","PeriodicalId":6397,"journal":{"name":"2011 Fourth International Conference on Information and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Solving Non-linear Equation Based on Steepest Descent Method\",\"authors\":\"Tianyou Zhang\",\"doi\":\"10.1109/ICIC.2011.107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper concerns with the problem of solving non-linear equation. It is shown that solving non-linear equation is equivalent to the evaluation extremum of funtion. In terms of unconstrained optimization using steepest descent method, we propose an algorithm for solving non-linear equation. It is shown that the proposed algorithm has the same convergence rate as the secant method. Several numerical experiments are also provided to demonstrate the effect of the proposed algorithm.\",\"PeriodicalId\":6397,\"journal\":{\"name\":\"2011 Fourth International Conference on Information and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Conference on Information and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIC.2011.107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Conference on Information and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC.2011.107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Non-linear Equation Based on Steepest Descent Method
This paper concerns with the problem of solving non-linear equation. It is shown that solving non-linear equation is equivalent to the evaluation extremum of funtion. In terms of unconstrained optimization using steepest descent method, we propose an algorithm for solving non-linear equation. It is shown that the proposed algorithm has the same convergence rate as the secant method. Several numerical experiments are also provided to demonstrate the effect of the proposed algorithm.