牛顿迭代法求非线性方程的根 调用格式：f_name函数名； x0初值； xmin,xmax：x坐标； n_point描绘曲线所用点数-Newton iteration of nonlinear equations for root Call format: f_name function names x0 initial value xmin, xmax: x coordinates n_point curve described by points

牛顿迭代法，比较经典的算法。理解这个算法，基本c++的运行都可以理解的清楚-Newton iteration, the classic algorithm. Understand this algorithm, basic c++ run can be understood clearly