SECANT ALGORITHM
2016-08-23
1 0 0
no vote
Other
Earn points
* To find a solution to the equation f(x) = 0
* given initial approximations p0 and p1:
*
* INPUT: initial approximation p0, p1; tolerance TOL;
* maximum number of iterations N0.
*
* OUTPUT: approximate solution p or
* a message that the algorithm fails.
*
* given initial approximations p0 and p1:
*
* INPUT: initial approximation p0, p1; 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