The program uses the bisection method for finding the roots. Only the tolerance and the function should be modified inside the program. The lower and upper bounds are AUTOMATICALLY found and should only be modified if the program fails to find any root. Only one root is found!
-
Notifications
You must be signed in to change notification settings - Fork 1
Akulav/AutomaticRootFinder
About
Root Finding using the bisection method. Automatically assigns bounds.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published