通过单项式序加速常微分方程系统李导数的Gröbner基计算
Faster Gröbner bases for Lie derivatives of ODE systems via monomial orderings
AI总结:
本文提出利用源自ODE模型结构的特定单项式序(含变量权重)加速李导数多项式系统的Gröbner基计算,并在多个符号计算框架中验证改进,应用于加速结构可辨识性分析。
摘要:
微分方程系统的符号计算通常计算代价高昂。许多实际微分模型具有多项式或有理常微分方程系统的形式,并带有指定的输出。分析这些模型的一种基本符号方法是:先计算输出函数关于由该常微分方程系统给出的向量场的足够多次李导数,得到多项式系统,再对其进行符号处理。在本文中,我们提出了一种方法,通过使用源自常微分方程模型结构的特定单项式序(包括变量的权重)来加速此类多项式系统的Gröbner基计算。我们提供了实证结果,表明该方法在不同的符号计算框架中均带来改进,并将其应用于加速常微分方程模型的结构可辨识性分析。
英文摘要:
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze these models is to compute and then symbolically process the polynomial system obtained by sufficiently many Lie derivatives of the output functions with respect to the vector field given by the ODE system. In this paper, we present a method for speeding up Gröbner basis computation for such a class of polynomial systems by using specific monomial ordering, including weights for the variables, coming from the structure of the ODE model. We provide empirical results that show improvement across different symbolic computing frameworks and apply the method to speed up structural identifiability analysis of ODE models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。