TL;DR
This paper introduces a new algorithm for differential elimination in dynamical systems that improves efficiency and enables structural identifiability analysis of complex models, with practical implementation in a Julia package.
Contribution
The paper presents a novel differential elimination algorithm that outperforms existing methods and a randomized approach for structural identifiability analysis of complex models.
Findings
Algorithm outperforms general-purpose software on benchmark models.
Enables identifiability analysis of previously intractable models.
Implementation available as a Julia package.
Abstract
Elimination of unknowns in a system of differential equations is often required when analysing (possibly nonlinear) dynamical systems models, where only a subset of variables are observable. One such analysis, identifiability, often relies on computing input-output relations via differential algebraic elimination. Determining identifiability, a natural prerequisite for meaningful parameter estimation, is often prohibitively expensive for medium to large systems due to the computationally expensive task of elimination. We propose an algorithm that computes a description of the set of differential-algebraic relations between the input and output variables of a dynamical system model. The resulting algorithm outperforms general-purpose software for differential elimination on a set of benchmark models from literature. We use the designed elimination algorithm to build a new randomized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
