Numerical comparison of conservation-based state transformations

Determine whether different choices of the transformation matrix \(\mathbf{T}\) require fewer solver steps for the Wang et al. rapid delayed rectifier potassium-current (\(I_{\mathrm{Kr}}\)) model and other example Markov models.

Background

The paper derives a family of conservation-preserving linear transformations T\mathbf{T} that reduce an NN-state Markov ODE system to an (N1)(N-1)-state system. Different choices can eliminate different state variables or linear combinations of states while retaining the conserved total occupancy and the nonzero eigenvalues of the original system.

Numerical experiments with the Wang et al. IKrI_{\mathrm{Kr}} model indicate that eliminating any one of its five state variables gives broadly similar computational performance. The paper leaves unresolved whether more general choices of T\mathbf{T} can reduce the number of solver steps, either for that model or for other models, particularly in settings with widely differing transition timescales.

References

Though it remains to be seen if different choices of \mathbf{T} require less solver steps for this, and other, example models.

Conservative deterministic Markov models in mathematical biology: uniqueness of steady states, reversibility and computational methods  (2608.27252 - Shuttleworth et al., 27 Aug 2026) in Section 5, subsection “Removing a state variable” (Section \ref{sec:examples}, subsection within Example I)