arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.13680cs.SCmath.AGmath.CA
收藏

通过支撑界投影动力系统

Projecting dynamical systems via a support bound

LIX, CNRS, École polytechnique, Institute Polytechnique de Paris(巴黎综合理工学院 LIX 实验室,法国国家科学研究中心,巴黎理工学院)

Yulia Mukhina, Gleb Pogudin

AI总结:

研究多项式动力系统中选定坐标满足的最小微分方程,提出基于支撑多面体的界,并设计算法解决微分消元问题,展示其在复杂问题上的优势。

摘要:

对于多项式动力系统,我们研究计算选定坐标所满足的最小微分方程的问题,即投影该系统。此问题可视为微分方程系统消元问题的特例,应用于建模与控制。我们为这类最小方程的牛顿多面体提供界。该界依赖于模型的维度以及定义所选坐标和其余坐标动力学的多项式次数d和D。我们证明当d≤D或模型为平面时,该界是紧致的。进一步,我们利用此界设计算法,基于评估-插值范式计算最小方程。我们展示所设计算法可解决现有微分消元软件无法处理的问题。

英文摘要:

For a polynomial dynamical system, we study the problem of computing the minimal differential equation satisfied by a chosen coordinate (in other words, projecting the system on the coordinate). This problem can be viewed as a special case of the general elimination problem for systems of differential equations and appears in applications to modeling and control. We give a bound for the Newton polytope of such minimal equation. Our bound depends on the dimension of the model and the degrees $d$ and $D$ of the polynomials defining the dynamics of the chosen coordinate and the remaining coordinates, respectively. We show that our bound is sharp if $d \leqslant D$ or the model is planar. We further use this bound to design an algorithm for computing the minimal equation following the evaluation-interpolation paradigm. We demonstrate that our implementation of the algorithm can tackle problems which are out of reach for the state-of-the-art software for differential elimination.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑