Closed ys1999 closed 5 years ago
Thanks for the contribution. For some reason the file appears as a binary and I cannot see it. Could you please try to upload it again.
Also, I suggest that you create a branch that is not master
when you make a PR.
You will need to add some tests.
You can check performance comparisons using the BenchmarkTools.jl
package.
Oops , I am sorry about this technical glitch . I will upload it again in the way as you mentioned .
Thank You Sir
On Tue, Jan 15, 2019 at 3:13 AM David P. Sanders notifications@github.com wrote:
Thanks for the contribution. For some reason the file appears as a binary and I cannot see it. Could you please try to upload it again.
Also, I suggest that you create a branch that is not master when you make a PR.
You will need to add some tests.
You can check performance comparisons using the BenchmarkTools.jl package.
— You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub https://github.com/JuliaIntervals/IntervalRootFinding.jl/pull/106#issuecomment-454172609, or mute the thread https://github.com/notifications/unsubscribe-auth/Ao1XJ0nMaZs33zrfZRiqKBQIqCTrQmewks5vDPnogaJpZM4Z_xY4 .
Closing since not actionable as is. Please re-open if there is further progress.
It is very much similar to Newton1d method. But the difference lies in its convergence formula , its convergence formula contains double derivative term . Advantage of chebyshev method over newton is that chebyshev method converges more rapidly than newton method . So I am not sure that it will be overall efficient or not??