You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
An interesting addition would be the possibility of passing a different stopping function to the root_finding method.
I.e. I`m looking for roots in x of a function f(t, x), where t may be a thick interval. I would like the stopping criteria to be the fact that the derivative w.r.t. to t of the root does not contain 0.
The text was updated successfully, but these errors were encountered:
But it sounds like you might get a complicated set, so maybe IntervalConstraintProgramming.jl would be more appropriate for that? Otherwise feel free to make a Pull Request!
Using the iterator version of the search, you can already do it by defining a custom Search type and defining a process function that suits your needs.
An interesting addition would be the possibility of passing a different stopping function to the root_finding method.
I.e. I`m looking for roots in x of a function f(t, x), where t may be a thick interval. I would like the stopping criteria to be the fact that the derivative w.r.t. to t of the root does not contain 0.
The text was updated successfully, but these errors were encountered: