AI Chat AI Image Generator AI Video Text to Speech

Faster Gröbner Bases via Domain-Specific Ordering in Parameter Identifiability of ODE Models

02/13/2022

∙

by Mariya Bessonov, et al.

∙

∙

We consider a specific class of polynomial systems that arise in parameter identifiability problems of models of ordinary differential equations (ODE) and discover a method for speeding up the Gröbner basis computation by using specific variable ordering and weights coming from the structure of the ODE model. We provide empirical results that show improvement across different symbolic computing frameworks.

Mariya Bessonov
3 publications
Ilia Ilmer
6 publications
Tatiana Konstantinova
4 publications
Alexey Ovchinnikov
14 publications
Gleb Pogudin
24 publications
Pedro Soto
5 publications

research

∙ 07/12/2017

Optimised finite difference computation from symbolic equations

Domain-specific high-productivity environments are playing an increasing...

0 Michael Lange, et al. ∙

research

∙ 08/17/2023

Bayesian polynomial neural networks and polynomial neural ordinary differential equations

Symbolic regression with polynomial neural networks and polynomial neura...

0 Colby Fronk, et al. ∙

research

∙ 07/24/2023

Predicting Ordinary Differential Equations with Transformers

We develop a transformer-based sequence-to-sequence model that recovers ...

0 Sören Becker, et al. ∙

research

∙ 02/02/2016

On the p-adic stability of the FGLM algorithm

Nowadays, many strategies to solve polynomial systems use the computatio...

0 Guénaël Renault, et al. ∙

research

∙ 09/05/2021

Nonintrusive model order reduction for cross-diffusion systems

In this paper, we investigate tensor based nonintrusive reduced-order mo...

0 Bülent Karasözen, et al. ∙

research

∙ 02/23/2021

Parameter estimation in nonlinear mixed effect models based on ordinary differential equations: an optimal control approach

We present a parameter estimation method for nonlinear mixed effect mode...

0 Quentin Clairon, et al. ∙

research

∙ 08/24/2015

A note on the complexity of the causal ordering problem

In this note we provide a concise report on the complexity of the causal...

0 Bernardo Gonçalves, et al. ∙