-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add notes about citing #32
base: main
Are you sure you want to change the base?
Conversation
issn = {1007-5704}, | ||
doi = {https://doi.org/10.1016/j.cnsns.2024.107816}, | ||
url = {https://www.sciencedirect.com/science/article/pii/S1007570424000029}, | ||
author = {Alexander Demin and Elizaveta Demitraki and Gleb Pogudin}, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think that the standard bibtex would be Lastname, Firstname
url = {https://www.sciencedirect.com/science/article/pii/S1007570424000029}, | ||
author = {Alexander Demin and Elizaveta Demitraki and Gleb Pogudin}, | ||
keywords = {Ordinary differential equations, Exact reduction, Lumping, Dimensionality reduction, Matrix algebras}, | ||
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.} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Shall we drop it?
year = {2024}, | ||
issn = {1007-5704}, | ||
doi = {https://doi.org/10.1016/j.cnsns.2024.107816}, | ||
url = {https://www.sciencedirect.com/science/article/pii/S1007570424000029}, |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I would suggest to take the url with doi.org
, is should be more permanent (well...)
@pogudingleb Could you please check the reference? Thanks.