Exact linear reduction for rational dynamical systems
Detailed dynamical systems models used in life sciences may include dozens or even hundreds of state variables. Models of large dimension are not only harder from the numerical perspective (e.g., for parameter estimation or simulation), but it is also becoming challenging to derive mechanistic insights from such models. Exact model reduction is a way to address this issue by finding a self-consistent lower-dimensional projection of the corresponding dynamical system. A recent algorithm CLUE allows one to construct an exact linear reduction of the smallest possible dimension such that the fixed variables of interest are preserved. However, CLUE is restricted to systems with polynomial dynamics. Since rational dynamics occurs frequently in the life sciences (e.g., Michaelis-Menten or Hill kinetics), it is desirable to extend CLUE to the models with rational dynamics. In this paper, we present an extension of CLUE to the case of rational dynamics and demonstrate its applicability on examples from literature. Our implementation is available in version 1.5 of CLUE at https://github.com/pogudingleb/CLUE.
Code (1)
Tasks
parameter estimationSimilar Papers 제목 키워드 기반
Exact hierarchical reductions of dynamical models via linear transformations
Dynamical models described by ordinary differential equations (ODEs) are a fundamental tool in the sciences and engineering. Exact reduction aims at producing a lower-dimensional model in which each macro-variable can be…
Interpretable exact linear reductions via positivity
Kinetic models of biochemical systems used in the modern literature often contain hundreds or even thousands of variables. While these models are convenient for detailed simulations, their size is often an obstacle to de…
Model Reduction of Linear Dynamical Systems via Balancing for Bayesian Inference
We consider the Bayesian approach to the linear Gaussian inference problem of inferring the initial condition of a linear dynamical system from noisy output measurements taken after the initial time. In practical applica…
Bayesian InferenceDimensionality ReductionThe Complexity of Verifying Feedforward Neural Networks in Quantised Settings
We investigate the computational complexity of neural network verification in quantised settings. We distinguish three classes of Feedforward Neural Networks (FNNs): rational FNNs with exact rational weights, quantised F…
Near Optimal Interpolation based Time-Limited Model Order Reduction
This paper presents an interpolatory framework for time-limited $H_2$ optimal model order reduction named Limited Time Iterative Rational Krylov Algorithm (LT-IRKA). The algorithm yields high fidelity reduced order model…