Scholarlink

We study an important special case of the differential elimination problem: given a polynomial parametric dynamical system \({{\,\mathrm{\textbf{x}}\,}}' = {{\,\mathrm{\textbf{g}}\,}}({{\,\mathrm{\boldsymbol{\mu }}\,}}, {{\,\mathrm{\textbf{x}}\,}})\) and a polynomial observation function \(y = f({{\,\mathrm{\boldsymbol{\mu }}\,}},{{\,\mathrm{\textbf{x}}\,}})\) , find the minimal differential equation satisfied by y. In our previous work [29], for the case \(y = x_1\) , we established a bound on the support of such a differential equation for the non-parametric case and showed that it can be turned into an algorithm via the evaluation-interpolation approach. The main contribution of the present paper is a generalization of the aforementioned result in two directions: to allow any polynomial function \(y = f({{\,\mathrm{\textbf{x}}\,}})\) , not just a single coordinate, and to allow \({{\,\mathrm{\textbf{g}}\,}}\) and f to depend on unknown symbolic parameters. We conduct computation experiments to evaluate the accuracy of our new bound and show that the approach allows to perform elimination for some cases out of reach for the state of the art software.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Support Bound for Differential Elimination in Polynomial Dynamical Systems

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Yulia Mukhina,
  • Gleb Pogudin

摘要

We study an important special case of the differential elimination problem: given a polynomial parametric dynamical system \({{\,\mathrm{\textbf{x}}\,}}' = {{\,\mathrm{\textbf{g}}\,}}({{\,\mathrm{\boldsymbol{\mu }}\,}}, {{\,\mathrm{\textbf{x}}\,}})\) and a polynomial observation function \(y = f({{\,\mathrm{\boldsymbol{\mu }}\,}},{{\,\mathrm{\textbf{x}}\,}})\) , find the minimal differential equation satisfied by y. In our previous work [29], for the case \(y = x_1\) , we established a bound on the support of such a differential equation for the non-parametric case and showed that it can be turned into an algorithm via the evaluation-interpolation approach. The main contribution of the present paper is a generalization of the aforementioned result in two directions: to allow any polynomial function \(y = f({{\,\mathrm{\textbf{x}}\,}})\) , not just a single coordinate, and to allow \({{\,\mathrm{\textbf{g}}\,}}\) and f to depend on unknown symbolic parameters. We conduct computation experiments to evaluate the accuracy of our new bound and show that the approach allows to perform elimination for some cases out of reach for the state of the art software.