We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Is it possible to specify a maximum number of bisections?
I see there are some functions where you can specify maxlevels:
maxlevels
function find_roots(f::Function, a::Interval{T}, method::Function = newton; tolerance = eps(T), debug = false, maxlevel = 30) where {T} method(f, a; tolerance=tolerance, debug=debug, maxlevel=maxlevel) end
but not sure if it's used in the method. I guess this was put here as a future feature?
I've tried also changing tol, but it didn't seem to change much.
tol
The text was updated successfully, but these errors were encountered:
This is not supported by the interface currently. IIRC find_roots is the older interface, that has been superseeded by roots.
find_roots
roots
In principle all that is needed is to pass the information around down to the search iterator and stop it early if the maxlevel is reached.
Related #59, #109, #116.
Sorry, something went wrong.
max_iteration
reltol
Successfully merging a pull request may close this issue.
Is it possible to specify a maximum number of bisections?
I see there are some functions where you can specify
maxlevels
:but not sure if it's used in the method. I guess this was put here as a future feature?
I've tried also changing
tol
, but it didn't seem to change much.The text was updated successfully, but these errors were encountered: