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? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
Our NewtonRaphson implementation isn't robust against functions that look like this
NewtonRaphson
julia> nl(t, p) = 0.010000000000000002 + 10.000000000000002 / (1 + (0.21640425613334457 + 216.40425613334457 / (1 + (0.21640425613334457 + 216.40425613334457 / (1 + 0.0006250000000000001(t^2.0)))^2.0))^2.0) - 0.0011552453009332421t nl (generic function with 2 methods) julia> solve(NonlinearProblem(nl, 10.0), NewtonRaphson()).retcode :MAXITERS_EXCEED
The text was updated successfully, but these errors were encountered:
And note NLSolveJL does succeed here.
Sorry, something went wrong.
I've implemented trustRegion.jl in SimpleNonlinearSolve.jl and I'll now give this a go. (I've got exams coming, but I'll try to fix it asap)
trustRegion.jl
SimpleNonlinearSolve.jl
Merge pull request #52 from SciML/dependabot/github_actions/actions/c…
5a6aa22
…heckout-3 Bump actions/checkout from 1 to 3
No branches or pull requests
Our

NewtonRaphson
implementation isn't robust against functions that look like thisThe text was updated successfully, but these errors were encountered: