Description
Backend-neutral lowered time problems, adaptive plans, and evidence.
Structs§
- Accepted
Time History - Cadence-independent accepted intervals and explicit event sides.
- Constant
Derivative Matrix Proof - A constant derivative Jacobian whose rank is computed without a numerical tolerance.
- Event
Flow Linearization - Vector fields immediately before and after one canonical event reset.
- Event
Forward Sensitivity - Event-time and fixed-time post-reset forward sensitivities.
- Event
Guard Linearization - First derivatives of one scalar event guard
g(t, y, p). - Event
Reset Linearization - First derivatives of one reset map
y^+ = rho(t, y^-, p). - Forward
Sensitivity Plan - Error-control policy for continuous forward sensitivities.
- Forward
Sensitivity Problem - One validated primal problem plus continuous parameter-JVP actions.
- Forward
Sensitivity Solution - Primal trajectory plus
dy/dp_jsamples for every declared parameter. - General
Implicit Lowering Proof - Backend-neutral witness for canonical Relation → general residual lowering.
- Implicit
DaeInitialization - Owned, shape-checked initial pair accepted by a residual-native adapter.
- Implicit
DaeProblem - Validated general residual problem with an explicit variable partition.
- Implicit
Midpoint Time Backend - Fixed-step implicit midpoint over the ordinary RHS/JVP and mass actions.
- Monomial
Derivative Row - One differential row in the full monomial view used to normalize an ODE.
- Reference
Implicit Time Backend - Small deterministic implicit-Euler/Newton oracle for general residuals.
- Registered
Root Problem - Root actions bound to the exact registration identity and callback proof.
- Root
Activation Group - One scalar root function mapped to a complete atomic Activation group.
- Root
Proposal - Backend-localized candidate presented to Eqiora’s hybrid scheduler.
- Root
Registration Id - SHA-256 identity of one validated, ordered root-function registration.
- Root
Registration Proof - Canonical callback order and Activation grouping proven by registration.
- Time
Backend Capabilities - Numerical representations an adapter accepts through the real-coordinate seam.
- Time
Backend Identity - Atomic adapter identity attached to accepted time execution.
- Time
Checkpoint - Accepted smooth prefix and the controller state needed to continue it exactly.
- Time
Event Discontinuity - Both sides of a committed reset at an exactly registered root proposal.
- Time
Execution Report - Backend and policy identity attached to an accepted time solution.
- Time
History Step - One accepted interval with its solver-native midpoint value.
- Time
Lowering Proof - Backend-neutral witness for canonical Relation → first-order lowering.
- Time
Plan - Complete adaptive integration and output-sampling policy for one run.
- Time
Problem - Validated, parameter-bound first-order problem.
- Time
Root Outcome - Requested native samples and complete smooth history through the first root or horizon. Optional forward sensitivities share the same accepted intervals and sample layout.
- Time
Solution - Dense field-local samples returned by a production time backend.
- Transversal
Event Linearization - Lowered first-order linearization of one isolated transversal event.
Enums§
- DaeVariable
Kind - Differential or algebraic role of one residual-native state coordinate.
- General
Implicit Reason - Structural reason a canonical Relation requires residual-native execution.
- Initial
Condition Policy - Meaning of the data supplied at the initial model time.
- Mass
Matrix Rank - Structural rank promised by the lowering that produced a mass matrix.
- Mass
Parameter Dependence - Parameter dependence admitted for a mass matrix during sensitivity solves.
- Time
Equation Class - Exact continuous equation class presented to a time backend.
- Time
Method - Integration algorithm selected by Realization, not model meaning.
Traits§
- Implicit
Time System - Residual and tangent actions for
F(t, y, y_dot) = 0. - Parametric
Time System - Parameter actions required to integrate continuous forward sensitivities.
- Root
Functions - Zero-crossing actions used only to propose candidate event instants.
- Time
System - Infallible-shape, fallible-value action for one lowered first-order system.