Skip to content

Bisection Algorithm is a method that is used to find the root of an equation in a given interval that is the value of ‘x’ for which f(x) = 0. It applies a line search using derivatives. Thus it is only applicable for derivative functions

License

Notifications You must be signed in to change notification settings

hilaliya/bisection

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

Bisection Algorithm: Line Search Using Derivatives

A screenshot of the program is given to solve the function f(x)= 3x^5 -4x^6.

Here, x is between the interval [-10,10] and the number of iterations is 3:

bisection

For more information about the algorithm please chack the book "Nonlinear Programming: Theory and Algorithms 3rd Edition" by Mokhtar S. Bazaraa (Author), Hanif D. Sherali (Author), C. M. Shetty (Author)

About

Bisection Algorithm is a method that is used to find the root of an equation in a given interval that is the value of ‘x’ for which f(x) = 0. It applies a line search using derivatives. Thus it is only applicable for derivative functions

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages