nlstac: Non-Gradient Separable Nonlinear Least Squares Fitting

IF 2.3 4区 计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
R Journal Pub Date : 2023-11-08 DOI:10.32614/rj-2023-040
J. A. F. Torvisco, R. Benítez, M. R. Arias, J. Cabello Sánchez
{"title":"nlstac: Non-Gradient Separable Nonlinear Least Squares Fitting","authors":"J. A. F. Torvisco, R. Benítez, M. R. Arias, J. Cabello Sánchez","doi":"10.32614/rj-2023-040","DOIUrl":null,"url":null,"abstract":"A new package for nonlinear least squares fitting is introduced in this paper. This package implements a recently developed algorithm that, for certain types of nonlinear curve fitting, reduces the number of nonlinear parameters to be fitted. One notable feature of this method is the absence of initialization which is typically necessary for nonlinear fitting gradient-based algorithms. Instead, just some bounds for the nonlinear parameters are required. Even though convergence for this method is guaranteed for exponential decay using the max-norm, the algorithm exhibits remarkable robustness, and its use has been extended to a wide range of functions using the Euclidean norm. Furthermore, this data-fitting package can also serve as a valuable resource for providing accurate initial parameters to other algorithms that rely on them.","PeriodicalId":51285,"journal":{"name":"R Journal","volume":"55 8","pages":"0"},"PeriodicalIF":2.3000,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"R Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32614/rj-2023-040","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

A new package for nonlinear least squares fitting is introduced in this paper. This package implements a recently developed algorithm that, for certain types of nonlinear curve fitting, reduces the number of nonlinear parameters to be fitted. One notable feature of this method is the absence of initialization which is typically necessary for nonlinear fitting gradient-based algorithms. Instead, just some bounds for the nonlinear parameters are required. Even though convergence for this method is guaranteed for exponential decay using the max-norm, the algorithm exhibits remarkable robustness, and its use has been extended to a wide range of functions using the Euclidean norm. Furthermore, this data-fitting package can also serve as a valuable resource for providing accurate initial parameters to other algorithms that rely on them.
nlstac:非梯度可分非线性最小二乘拟合
介绍了一种新的非线性最小二乘拟合方法。这个包实现了一个最近开发的算法,对于某些类型的非线性曲线拟合,减少了要拟合的非线性参数的数量。该方法的一个显著特点是不需要初始化,而初始化对于基于梯度的非线性拟合算法来说是非常必要的。相反,只需要非线性参数的一些界限。尽管使用最大范数保证了该方法对指数衰减的收敛性,但该算法显示出显著的鲁棒性,并且它的使用已扩展到使用欧几里得范数的广泛函数。此外,这个数据拟合包也可以作为一个宝贵的资源,为依赖于它们的其他算法提供准确的初始参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
R Journal
R Journal COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-STATISTICS & PROBABILITY
CiteScore
2.70
自引率
0.00%
发文量
40
审稿时长
>12 weeks
期刊介绍: The R Journal is the open access, refereed journal of the R project for statistical computing. It features short to medium length articles covering topics that should be of interest to users or developers of R. The R Journal intends to reach a wide audience and have a thorough review process. Papers are expected to be reasonably short, clearly written, not too technical, and of course focused on R. Authors of refereed articles should take care to: - put their contribution in context, in particular discuss related R functions or packages; - explain the motivation for their contribution; - provide code examples that are reproducible.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信