Theory
Theory¶
The Start and Analysis sections describe the API. This section specifies what the library does underneath: how symbolic equations become native code, what equations the Lyapunov routines actually solve, and which conventions (shapes, time semantics, resolution orders) the implementation commits to. Read it when you need to check a result against your own derivation, or to predict what a cache or a sweep will cost.
| Page | What it covers |
|---|---|
| Compilation pipeline | Symbolic RHS → C → cached .so; structural vs. control parameters; cache keys; Numba for maps; autogenerated Jacobians |
| Lyapunov exponents | Variational equations, QR re-orthonormalization, time-weighted averaging, the DDE caveat, the Kaplan–Yorke conjecture |
| Conventions | Time vs. steps, array shapes, IC resolution priority, map parameter order, metadata history semantics |
See also¶
- The mental model — the prose introduction these pages formalize
- Reference — exact signatures of everything mentioned here