符号与近似线性微分变量相交的算法

S. Deng, Zahra Mohammadi, G. Reid
{"title":"符号与近似线性微分变量相交的算法","authors":"S. Deng, Zahra Mohammadi, G. Reid","doi":"10.1109/SYNASC57785.2022.00020","DOIUrl":null,"url":null,"abstract":"This article provides algorithms for systems of approximate linear partial differential equations that exploit exact subsystems. Such exact systems have rational function coefficients over $\\mathbb{Q}$ and can be reduced to forms (e.g. differential Gröbner bases) by a finite number of differentiations and eliminations using available computer implementations. We will use the rifsimp algorithm in Maple for this purpose. Such algorithms use solvers based on orderings (rankings) of their derivatives, are coordinate dependent, and are prone to instability when applied to approximate input. In contrast, our Geometric Involutive Form algorithm, uses a sequence of geometric differentiations (prolongations) and projections to complete approximate linear systems to geometric involutive form. In particular, it uses numerical linear algebra (especially the SVD) to monitor dimension criteria for termination. However, this latter method can be expensive as the size of the matrices rapidly increases with the number of variables and order of derivatives involved.Approximate differential systems in applications often have exact subsystems and this motivated us to develop the hybrid method described in this article. The first step of the method is to partition the input into an exact subsystem and an approximate subsystem. The exact subsystem is reduced by using our rifsimp algorithm. The reduced exact subsystem is used to simplify the approximate subsystem. The previous partition, reduction and simplification steps are repeated until no new exact equations are found. Then the reduced exact subsystem is used to simplify prolongations of the approximate subsystem. Checking that the jointly prolonged system is geometrically involutive is done by computing dimension criteria of the simplified prolonged approximate system and using the differential Hilbert function of the reduced exact system.Our algorithm is illustrated by determination of approximate symmetry properties of a gravitational potential for a gaseous cloud. It enables a significant reduction of the size of the coefficient matrices of prolongations involved in numerical computations compared to our previous approach. For instance, the dimension of the jet space used for approximate calculations is reduced from dim J7 = 1320 to dim J1 = 20.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithm for intersecting symbolic and approximate linear differential varieties\",\"authors\":\"S. Deng, Zahra Mohammadi, G. Reid\",\"doi\":\"10.1109/SYNASC57785.2022.00020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article provides algorithms for systems of approximate linear partial differential equations that exploit exact subsystems. Such exact systems have rational function coefficients over $\\\\mathbb{Q}$ and can be reduced to forms (e.g. differential Gröbner bases) by a finite number of differentiations and eliminations using available computer implementations. We will use the rifsimp algorithm in Maple for this purpose. Such algorithms use solvers based on orderings (rankings) of their derivatives, are coordinate dependent, and are prone to instability when applied to approximate input. In contrast, our Geometric Involutive Form algorithm, uses a sequence of geometric differentiations (prolongations) and projections to complete approximate linear systems to geometric involutive form. In particular, it uses numerical linear algebra (especially the SVD) to monitor dimension criteria for termination. However, this latter method can be expensive as the size of the matrices rapidly increases with the number of variables and order of derivatives involved.Approximate differential systems in applications often have exact subsystems and this motivated us to develop the hybrid method described in this article. The first step of the method is to partition the input into an exact subsystem and an approximate subsystem. The exact subsystem is reduced by using our rifsimp algorithm. The reduced exact subsystem is used to simplify the approximate subsystem. The previous partition, reduction and simplification steps are repeated until no new exact equations are found. Then the reduced exact subsystem is used to simplify prolongations of the approximate subsystem. Checking that the jointly prolonged system is geometrically involutive is done by computing dimension criteria of the simplified prolonged approximate system and using the differential Hilbert function of the reduced exact system.Our algorithm is illustrated by determination of approximate symmetry properties of a gravitational potential for a gaseous cloud. It enables a significant reduction of the size of the coefficient matrices of prolongations involved in numerical computations compared to our previous approach. For instance, the dimension of the jet space used for approximate calculations is reduced from dim J7 = 1320 to dim J1 = 20.\",\"PeriodicalId\":446065,\"journal\":{\"name\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC57785.2022.00020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC57785.2022.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提供了利用精确子系统的近似线性偏微分方程组的算法。这样的精确系统在$\mathbb{Q}$上具有有理函数系数,并且可以通过使用可用的计算机实现的有限数量的微分和消去简化为形式(例如微分Gröbner基)。为此,我们将使用Maple中的rifsimp算法。这种算法使用基于其导数排序(排名)的求解器,依赖于坐标,并且在应用于近似输入时容易出现不稳定。相反,我们的几何对合形式算法,使用一系列几何微分(延伸)和投影来完成近似线性系统的几何对合形式。特别是,它使用数值线性代数(特别是SVD)来监视终止的维度标准。然而,后一种方法可能是昂贵的,因为矩阵的大小随着变量的数量和所涉及的导数的顺序而迅速增加。应用中的近似微分系统通常具有精确的子系统,这促使我们开发本文中描述的混合方法。该方法的第一步是将输入划分为精确子系统和近似子系统。采用我们的rifsimp算法对精确子系统进行了简化。采用简化精确分系统对近似分系统进行简化。重复之前的划分、简化和简化步骤,直到没有找到新的精确方程。然后利用简化的精确分系统来简化近似分系统的延拓。通过计算简化后的扩展近似系统的尺寸判据,利用简化后的精确系统的微分希尔伯特函数,验证了联合扩展系统的几何对合性。通过确定气体云引力势的近似对称性来说明我们的算法。与我们以前的方法相比,它可以显著减少数值计算中涉及的延长系数矩阵的大小。例如,用于近似计算的射流空间的维数从dim J7 = 1320降为dim J1 = 20。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Algorithm for intersecting symbolic and approximate linear differential varieties
This article provides algorithms for systems of approximate linear partial differential equations that exploit exact subsystems. Such exact systems have rational function coefficients over $\mathbb{Q}$ and can be reduced to forms (e.g. differential Gröbner bases) by a finite number of differentiations and eliminations using available computer implementations. We will use the rifsimp algorithm in Maple for this purpose. Such algorithms use solvers based on orderings (rankings) of their derivatives, are coordinate dependent, and are prone to instability when applied to approximate input. In contrast, our Geometric Involutive Form algorithm, uses a sequence of geometric differentiations (prolongations) and projections to complete approximate linear systems to geometric involutive form. In particular, it uses numerical linear algebra (especially the SVD) to monitor dimension criteria for termination. However, this latter method can be expensive as the size of the matrices rapidly increases with the number of variables and order of derivatives involved.Approximate differential systems in applications often have exact subsystems and this motivated us to develop the hybrid method described in this article. The first step of the method is to partition the input into an exact subsystem and an approximate subsystem. The exact subsystem is reduced by using our rifsimp algorithm. The reduced exact subsystem is used to simplify the approximate subsystem. The previous partition, reduction and simplification steps are repeated until no new exact equations are found. Then the reduced exact subsystem is used to simplify prolongations of the approximate subsystem. Checking that the jointly prolonged system is geometrically involutive is done by computing dimension criteria of the simplified prolonged approximate system and using the differential Hilbert function of the reduced exact system.Our algorithm is illustrated by determination of approximate symmetry properties of a gravitational potential for a gaseous cloud. It enables a significant reduction of the size of the coefficient matrices of prolongations involved in numerical computations compared to our previous approach. For instance, the dimension of the jet space used for approximate calculations is reduced from dim J7 = 1320 to dim J1 = 20.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信