{"title":"Searching for Laurent Solutions of Truncated Systems of Linear Differential Equations with the Use of EG-Eliminations","authors":"A. A. Ryabenko, D. E. Khmelnov","doi":"10.1134/s0361768824020129","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Laurent solutions of systems of linear ordinary differential equations with truncated power series as coefficients are considered. The Laurent series in the solutions are also truncated. As a means for constructing such solutions, induced recurrent systems are used; earlier, an algorithm for the case when the induced recurrent system has a nonsingular leading matrix was proposed. For the series in solutions, this algorithm finds the maximum possible number of terms that are invariant with respect to any prolongation of the truncated coefficients of the original system. Results on extending the applicability of the earlier proposed algorithm to the case when the leading matrix is singular using the EG-elimination algorithm as an auxiliary tool. An implementation of the proposed algorithm in the form of a Maple procedure is given and examples of its use are presented.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Programming and Computer Software","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0361768824020129","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Laurent solutions of systems of linear ordinary differential equations with truncated power series as coefficients are considered. The Laurent series in the solutions are also truncated. As a means for constructing such solutions, induced recurrent systems are used; earlier, an algorithm for the case when the induced recurrent system has a nonsingular leading matrix was proposed. For the series in solutions, this algorithm finds the maximum possible number of terms that are invariant with respect to any prolongation of the truncated coefficients of the original system. Results on extending the applicability of the earlier proposed algorithm to the case when the leading matrix is singular using the EG-elimination algorithm as an auxiliary tool. An implementation of the proposed algorithm in the form of a Maple procedure is given and examples of its use are presented.
期刊介绍：
Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
