BISECTION ALGORITHM
2016-08-23
0 0 0
no vote
Other
Earn points
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 N0.
*
* OUTPUT: approximate solution p or
* a message that the algorithm fails.
*/
* 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 N0.
*
* OUTPUT: approximate solution p or
* a message that the algorithm fails.
*/
c++
算法
二分
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment