Eric Biagioli, Federico Bergero, R. Oliveira, L. Peñaranda
{"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}
引用次数: 0
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.