应用寻根技术扩展基于量子化状态系统的求解器

Eric Biagioli, Federico Bergero, R. Oliveira, L. Peñaranda
{"title":"应用寻根技术扩展基于量子化状态系统的求解器","authors":"Eric Biagioli, Federico Bergero, R. Oliveira, L. Peñaranda","doi":"10.1109/CLEI.2016.7833372","DOIUrl":null,"url":null,"abstract":"In this work we propose the usage of root isolation algorithms to extend Quantized-State-Systems-based methods for integrating systems of Ordinary Differential Equations to higher orders. QSS methods of order n, at their inner loop, neet to compute the minimum positive root of a n-degree polynomial. The lack of analytical expressions for the roots of polynomial of degree greater than four limits the QSS methods to fourth order or less. We make an observation which, combined with the usage of root-finding techniques, allows the generalization to QSS of any order. Moreover, we show experimentally that, considering our algorithmic improvements, higher order methods do require considerably fewer iterations than lower order ones.","PeriodicalId":235402,"journal":{"name":"2016 XLII Latin American Computing Conference (CLEI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Applying root-finding techniques to extend Quantized-State-Systems-based solvers\",\"authors\":\"Eric Biagioli, Federico Bergero, R. Oliveira, L. Peñaranda\",\"doi\":\"10.1109/CLEI.2016.7833372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we propose the usage of root isolation algorithms to extend Quantized-State-Systems-based methods for integrating systems of Ordinary Differential Equations to higher orders. QSS methods of order n, at their inner loop, neet to compute the minimum positive root of a n-degree polynomial. The lack of analytical expressions for the roots of polynomial of degree greater than four limits the QSS methods to fourth order or less. We make an observation which, combined with the usage of root-finding techniques, allows the generalization to QSS of any order. Moreover, we show experimentally that, considering our algorithmic improvements, higher order methods do require considerably fewer iterations than lower order ones.\",\"PeriodicalId\":235402,\"journal\":{\"name\":\"2016 XLII Latin American Computing Conference (CLEI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 XLII Latin American Computing Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2016.7833372\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 XLII Latin American Computing Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2016.7833372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这项工作中,我们提出使用根隔离算法将基于量子化状态系统的常微分方程系统积分方法扩展到更高阶。工作频率的方法n,内循环,重复计算的最小正根n-degree多项式。由于缺乏四次以上多项式根的解析表达式,使得QSS方法只能满足四阶或更低的要求。我们做了一个观察,结合查找根技术的使用,允许推广到任何顺序的QSS。此外,我们通过实验证明,考虑到我们的算法改进,高阶方法确实比低阶方法需要更少的迭代。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Applying root-finding techniques to extend Quantized-State-Systems-based solvers
In this work we propose the usage of root isolation algorithms to extend Quantized-State-Systems-based methods for integrating systems of Ordinary Differential Equations to higher orders. QSS methods of order n, at their inner loop, neet to compute the minimum positive root of a n-degree polynomial. The lack of analytical expressions for the roots of polynomial of degree greater than four limits the QSS methods to fourth order or less. We make an observation which, combined with the usage of root-finding techniques, allows the generalization to QSS of any order. Moreover, we show experimentally that, considering our algorithmic improvements, higher order methods do require considerably fewer iterations than lower order ones.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信