Pith. sign in

REVIEW 1 cited by

Exact hierarchical reductions of dynamical models via linear transformations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.11653 v2 pith:CVNK5GRC submitted 2023-01-27 eess.SY cs.MScs.SCcs.SYmath.DS

classification eess.SYcs.MScs.SCcs.SYmath.DS
keywords exactmodelreductionalgorithmlinearreductionsdynamicalimplementation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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 directly related to the original variables, and it is thus a natural step towards the model's formal analysis and mechanistic understanding. We present an algorithm which, given a polynomial ODE model, computes a longest possible chain of exact linear reductions of the model such that each reduction refines the previous one, thus giving a user control of the level of detail preserved by the reduction. This significantly generalizes over the existing approaches which compute only the reduction of the lowest dimension subject to an approach-specific constraint. The algorithm reduces finding exact linear reductions to a question about representations of finite-dimensional algebras. We provide an implementation of the algorithm, demonstrate its performance on a set of benchmarks, and illustrate the applicability via case studies. Our implementation is freely available at https://github.com/x3042/ExactODEReduction.jl

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings

    cs.SC 2025-04 conditional novelty 6.0 of 10

    A randomized Newton-Hensel lifting algorithm computes the unique representation f of a polynomial h in a subring generated by algebraically independent polynomials g_1,...,g_n in O~((nL_1+n^4+L_2)M(Delta,n)) field operations.

Pith tools