A new nonlinear ABS-type algorithm and its efficiency analysis ∗

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY Accounts of Chemical Research Pub Date : 1998-01-01 DOI:10.1080/10556789808805702
N. Deng, Z. Chen
{"title":"A new nonlinear ABS-type algorithm and its efficiency analysis ∗","authors":"N. Deng, Z. Chen","doi":"10.1080/10556789808805702","DOIUrl":null,"url":null,"abstract":"As a continuation work following [4] and [5], a new ABS-type algorithm for a nonlinear system of equations is proposed. A major iteration of this algorithm requires n component evaluations and only one gradient evaluation. We prove that the algorithm is superlinearly convergent with R-order at least τ n , where τ n is the unique positive root of τn −τn−1 −1=0. It is shown that the new algorithm is usually more efficient than the methods of Newton, Brown and Brent, and the ABS-type algorithms in [1], [4] and [5], in the sense of some standard efficiency measure.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10556789808805702","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/10556789808805702","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 2

Abstract

As a continuation work following [4] and [5], a new ABS-type algorithm for a nonlinear system of equations is proposed. A major iteration of this algorithm requires n component evaluations and only one gradient evaluation. We prove that the algorithm is superlinearly convergent with R-order at least τ n , where τ n is the unique positive root of τn −τn−1 −1=0. It is shown that the new algorithm is usually more efficient than the methods of Newton, Brown and Brent, and the ABS-type algorithms in [1], [4] and [5], in the sense of some standard efficiency measure.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的非线性abs型算法及其效率分析
作为继[4]和[5]之后的延续工作,提出了一种新的求解非线性方程组的abs型算法。该算法的一次主要迭代需要n个分量评估和一次梯度评估。我们证明了该算法在r阶至少τn下是超线性收敛的,其中τn是τn−τn−1−1=0的唯一正根。结果表明,在某种标准效率度量的意义上,新算法通常比Newton、Brown和Brent方法以及[1]、[4]和[5]中的abs型算法效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
期刊最新文献
Management of Cholesteatoma: Hearing Rehabilitation. Congenital Cholesteatoma. Evaluation of Cholesteatoma. Management of Cholesteatoma: Extension Beyond Middle Ear/Mastoid. Recidivism and Recurrence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1