Many kinds of chaos are sharing the same Recover logic. A typical Recover function is like below:

func (r *Reconciler) Recover(ctx context.Context, req ctrl.Request, obj v1alpha1.InnerObject) error {

	podchaos, ok := obj.(*v1alpha1.PodChaos)
	if !ok {
		err := errors.New("chaos is not PodChaos")
		r.Log.Error(err, "chaos is not PodChaos", "chaos", obj)
		return err
	}

	if er

TSP claims to be type agnostic.
There should be tests for this.
In particular Float32 and Complex numbers will be of Interest.

Want to back this issue? **[Post a bounty on it!](https://www.bountysource.com/issues/64400386-add-tests-for-different-number-types-float32-complex?utm_campaign=plugin&utm_content=tracker%2F89129719&utm_medium=issues&utm_source=githu

It would be nice to modify the lyapunovs function (and via same process also the lyapunov) to have a convergence argument, that terminates evolution when numerical convergence is met. If convergence is given, then the argument T means maximum integration time in case convergence is not reached until then.

One way I envision checking for convergence is via a running average: we store i