BISECTION ALGORITHM
2016-08-23
1 0 0
no vote
Other
Earn points
BISECTION ALGORITHM 2.1
To find a solution to f(x) = 0 given the continuous function
f on the interval [a,b], where f(a) and f(b) have
opposite signs:
INPUT: endpoints a,b; tolerance TOL;
maximum number of iterations NO.
OUTPUT: approximate solution p or
a message that the algorithm fails.
To find a solution to f(x) = 0 given the continuous function
f on the interval [a,b], where f(a) and f(b) have
opposite signs:
INPUT: endpoints a,b; tolerance TOL;
maximum number of iterations NO.
OUTPUT: approximate solution p or
a message that the algorithm fails.
matlab
算法
二分
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment