solve

jumpax.solve(jumps: jumpax.AbstractJumpProblem, solver: jumpax.AbstractAggregator, save: jumpax.Save, u0: Shaped[Array, '?*u'], *, t0: Real[ArrayLike, ''], t1: Real[ArrayLike, ''], key: Key[Array, ''], args: PyTree[Any] = None, max_steps: int = 4096) -> jumpax.Solution

Simulate a jump process from t0 to t1.

Arguments:

• jumps: the jump problem to solve
• solver: the aggregator/solver to use (e.g., jumpax.SSA)
• save: controls what to save (states, counts, dense output)
• u0: initial state
• t0: start time
• t1: end time
• key: JAX random key
• args: static arguments passed to rate and affect functions
• max_steps: maximum number of solver steps before termination

Returns:

A jumpax.Solution containing saved times, states, and statistics.