Bisection method to find roots matlab code
Answers
Answered by
1
BISECTION is a fast, simple-to-use, and robust root-finding method that handles n-dimensional arrays.
Additional optional inputs and outputs for more control and capabilities that don't exist in other implementations of the bisection method or other root finding functions like fzero.
This function really shines in cases where fzero would have to be implemented in a loop to solve multiple cases, in which case this will be much faster.
It can find zero or non-zero roots.
This code can be a bit cryptic. This is for the sake of speed and increased capability. See the many acknowledged other submissions for simpler, easier-to-follow implementations to understand the basics of the bisection method.
hope it helps!!✌✌✌✌
keep always smiling☺☺☺
Additional optional inputs and outputs for more control and capabilities that don't exist in other implementations of the bisection method or other root finding functions like fzero.
This function really shines in cases where fzero would have to be implemented in a loop to solve multiple cases, in which case this will be much faster.
It can find zero or non-zero roots.
This code can be a bit cryptic. This is for the sake of speed and increased capability. See the many acknowledged other submissions for simpler, easier-to-follow implementations to understand the basics of the bisection method.
hope it helps!!✌✌✌✌
keep always smiling☺☺☺
Similar questions