📜  二分法与牛顿拉夫森法的区别

📅  最后修改于: 2022-05-13 01:56:04.236000             🧑  作者: Mango

二分法与牛顿拉夫森法的区别

数值方法是通过将算术运算应用于数值方程的一组任务。我们可以制定数学问题来找到近似的结果。这个公式称为问题的数值实现。在这方面,不需要算法。然后为数值实现开发编程逻辑。编程通常使用一些高级语言,如 Fortran、Basic 等。

二分法

这种方法是基于中间值属性的重复应用。设f(x)是闭区间[x 1 , x 2 ]内的连续函数,若f(x 1 ), f(x 2 )符号相反,则区间(x)内至少有一个根α 1 , x 2 ),使得 f(α) = 0。

二分法

公式为: x 2 = (x 0 + x 1 ) / 2

牛顿拉夫森法

Newton Raphson 方法是确定方程 f(x)=0 的实根的过程,仅给出接近所需根的一点。

牛顿拉夫森法

公式为: x 1 = x 0 – f(x 0 )/f'(x 0 )

二等分法与牛顿拉夫森法的比较

Sr. No.Bisection MethodNewton Raphson Method
1.In the Bisection Method, the rate of convergence is linear thus it is slow.In the Newton Raphson method, the rate of convergence is second-order or quadratic.
2.

In Bisection Method we used following formula

x2= (x0 + x1) / 2

In Newton Raphson method we used following formula 

x1 = x0 – f(x0)/f'(x0)

3.In this method, we take two initial approximations of the root in which the root is expected to lie.In this method, we take one initial approximation of the root.
4.The computation of function per iteration is 1.The computation of function per iteration is 2.
5.The initial approximation is less sensitive.The initial approximation is very sensitive.
6.In the Bisection Method, there is no need to find derivatives.In the Newton Raphson method, there is a need to find derivatives.
7.This method is not applicable for finding complex, multiple, and nearly equal two roots.This method is applicable for finding complex, multiple, and nearly equal two roots.

问题 1:求方程 f(x) = x 3 – x – 1 的根

解决方案:

问题 2:求方程 f(x) = 2x 3 – 2x – 5 的根

解决方案:

问题 3:求方程 f(x) = x 3 – x – 1 的根

解决方案:

问题 4:求方程 f(x) = 2x 3 – 2x – 5 的根

解决方案: