Exploring Complex Dynamical Systems via Nonconvex Optimization

Hunter Elliott
1/3/2023
cs.LGmath.DSmath.OC

No confident code implementation found for this paper.

Abstract

Cataloging the complex behaviors of dynamical systems can be challenging, even when they are well-described by a simple mechanistic model. If such a system is of limited analytical tractability, brute force simulation is often the only resort. We present an alternative, optimization-driven approach using tools from machine learning. We apply this approach to a novel, fully-optimizable, reaction-diffusion model which incorporates complex chemical reaction networks (termed "Dense Reaction-Diffusion Network" or "Dense RDN"). This allows us to systematically identify new states and behaviors, including pattern formation, dissipation-maximizing nonequilibrium states, and replication-like dynamical structures.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{elliott2023exploring,
  title  = {Exploring Complex Dynamical Systems via Nonconvex Optimization},
  author = {Hunter Elliott},
  year   = {2023},
  eprint = {2301.00923},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.00923v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.00923.svg)](https://codeofpaper.com/paper/2301.00923)

Discussion