Systems of differential-algebraic equations (DAEs) are generated routinely by simulation and modeling environments such as Modelica and MapleSim. Before a simulation starts and a numerical solution method is applied, some kind of structural analysis is performed to determine the structure and the index of a DAE. Structural analysis methods serve as a necessary preprocessing stage, and among them, Pantelides's algorithm is widely used.
Recently Pryce's $Σ$-method is becoming increasingly popular, owing to its straightforward approach and capability of analyzing high-order systems. Both methods are equivalent in the sense that when one succeeds, producing a nonsingular system Jacobian, the other also succeeds, and the two give the same structural index.
Although provably successful on fairly many problems of interest, the structural analysis methods can fail on some simple, solvable DAEs and give incorrect structural information including the index. In this report, we focus on the $Σ$-method. We investigate its failures, and develop two symbolic-numeric conversion methods for converting a DAE, on which the $Σ$-method fails, to an equivalent problem on which this method succeeds. Aimed at making structural analysis methods more reliable, our conversion methods exploit structural information of a DAE, and require a symbolic tool for their implementation.
Breaking the Data Barrier in Learning Symbolic Computation: A Case Study on Variable Ordering Suggestion for Cylindrical Algebraic Decomposition
School of Mathematical Sciences, Jiangsu University(江苏大学数学科学学院);Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences(中国科学院重庆绿色智能技术研究所);Chongqing School, University of Chinese Academy of Sciences(中国科学院大学重庆学院)
A Symbolic Approach to Boundary Problems for Linear Partial Differential Equations: Applications to the Completely Reducible Case of the Cauchy Problem with Constant Coefficients
Symbolic-Numeric Factorization of Differential Operators
我们提出了一个符号-数值Las Vegas算法分解Fuchsian常微分算子的有理函数系数。新算法结合了van Hoeij的“局部到全局”方法和van der Hoeven提出的“分析”方法的思想。它本质上减少到前者在“简单”的情况下,局部到全局的方法成功,并在“最困难”的情况下,后者的优化变体,同时处理中间情况比两者更有效。
Arboretum.hs: Symbolic manipulation for algebras of graphs
Mathematical Sciences, Chalmers and Gothenburg University(查尔姆斯理工大学和哥德堡大学);Department of Computer Science, University of Geneva(日内瓦大学);Section of Mathematics, University of Geneva(日内瓦大学)
Arboretum.hs 通过 Haskell 实现图代数的符号运算,提供直观的数学定义代码,支持新运算实验和 LaTeX 渲染,相比 Julia 和 Python 等语言更具灵活性和安全性。
Towards a Symbolic-Numeric Method to Compute Puiseux Series: The Modular Part
我们设计了一种新的符号-数值策略来高效而精确地计算由代数数域上的二元多项式定义的浮点Puietrix级数。本质上,计算模一个精心选择的素数$p$用于获得指导浮点计算所需的确切信息。本文详细介绍了算法的符号部分:首先,我们研究了Puixix级数的模约简,给出了一个很好的约简准则,保证了数值部分所需的信息得到保留。为了建立我们的结果,我们介绍了一个简单的修改经典牛顿多边形,我们称之为“通用牛顿多边形”,这是非常方便的。然后,我们估计了计算有限域上的Pu i i n x级数的算术复杂度,并改进了已知的界。最后,我们给出了符号部分的确定性和随机化版本的位复杂性界。数字部分的细节将在即将发表的论文中描述。