用特征环形式约简奇异线性微分系统的新方法

M. Barkatou, Joelle Saadé, Jacques-Arthur Weil
{"title":"用特征环形式约简奇异线性微分系统的新方法","authors":"M. Barkatou, Joelle Saadé, Jacques-Arthur Weil","doi":"10.1145/3208976.3209016","DOIUrl":null,"url":null,"abstract":"We give a new algorithm for the formal reduction of linear differential systems with Laurent series coefficients. We show how to obtain a decomposition of Balser, Jurkat and Lutz using eigenring techniques. We establish structural information on the obtained indecomposable subsystems and retrieve information on their invariants such as ramification. We show why classical algorithms then perform well on these subsystems. We also give precise estimates of the precision on the power series which is required in each step of our algorithm. The algorithm is implemented in Maple. We give examples in [14].","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Approach for Formal Reduction of Singular Linear Differential Systems Using Eigenrings\",\"authors\":\"M. Barkatou, Joelle Saadé, Jacques-Arthur Weil\",\"doi\":\"10.1145/3208976.3209016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a new algorithm for the formal reduction of linear differential systems with Laurent series coefficients. We show how to obtain a decomposition of Balser, Jurkat and Lutz using eigenring techniques. We establish structural information on the obtained indecomposable subsystems and retrieve information on their invariants such as ramification. We show why classical algorithms then perform well on these subsystems. We also give precise estimates of the precision on the power series which is required in each step of our algorithm. The algorithm is implemented in Maple. We give examples in [14].\",\"PeriodicalId\":105762,\"journal\":{\"name\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3208976.3209016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3208976.3209016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

给出了具有洛朗级数系数的线性微分系统形式约简的一种新算法。我们展示了如何使用特征环技术获得Balser, Jurkat和Lutz的分解。我们在得到的不可分解子系统上建立结构信息,并检索其分支等不变量的信息。我们展示了为什么经典算法在这些子系统上表现良好。我们还给出了算法每一步所需的幂级数精度的精确估计。该算法在Maple中实现。我们在[14]中给出了例子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A New Approach for Formal Reduction of Singular Linear Differential Systems Using Eigenrings
We give a new algorithm for the formal reduction of linear differential systems with Laurent series coefficients. We show how to obtain a decomposition of Balser, Jurkat and Lutz using eigenring techniques. We establish structural information on the obtained indecomposable subsystems and retrieve information on their invariants such as ramification. We show why classical algorithms then perform well on these subsystems. We also give precise estimates of the precision on the power series which is required in each step of our algorithm. The algorithm is implemented in Maple. We give examples in [14].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Constructive Arithmetics in Ore Localizations with Enough Commutativity Extending the GVW Algorithm to Local Ring Comparison of CAD-based Methods for Computation of Rational Function Limits Polynomial Equivalence Problems for Sum of Affine Powers Fast Straightening Algorithm for Bracket Polynomials Based on Tableau Manipulations
×
引用
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