Optimal monomial quadratization for ODE systems - Archive ouverte HAL
Communication Dans Un Congrès Année : 2021

Optimal monomial quadratization for ODE systems

Résumé

Quadratization problem is, given a system of ODEs with polynomial right-hand side, transform the system to a system with quadratic right-hand side by introducing new variables. Such transformations have been used, for example, as a preprocessing step by model order reduction methods and for transforming chemical reaction networks. We present an algorithm that, given a system of polynomial ODEs, finds a transformation into a quadratic ODE system by introducing new variables which are monomials in the original variables. The algorithm is guaranteed to produce an optimal transformation of this form (that is, the number of new variables is as small as possible), and it is the first algorithm with such a guarantee we are aware of. Its performance compares favorably with the existing software, and it is capable to tackle problems that were out of reach before.
Fichier principal
Vignette du fichier
2103.08013.pdf (420 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03826844 , version 1 (15-02-2024)

Identifiants

Citer

Andrey Bychkov, Gleb Pogudin. Optimal monomial quadratization for ODE systems. International Workshop on Combinatorial Algorithms, Jul 2021, Ottawa (Ontario), Canada. pp.122-136, ⟨10.1007/978-3-030-79987-8_9⟩. ⟨hal-03826844⟩
23 Consultations
23 Téléchargements

Altmetric

Partager

More