利用Mathematica求解方程的近似根

Make Use of Mathematica to Solve Approximate Root of Function

本文分别按牛顿迭代法原理和对分区间法原理,利用Mathematica编程计算了同一个函数在误差允许范围内的所有近似根,通过比较例题的结果,得出牛顿法收敛速度快于对分区间法,且误差较小。

In this paper, according to the principle of Newton iteration theory and the principle of Opposite Dividing Method for Intervals respectively, we calculate all the approximate root of the same function in the range of error allowed using Mathematica programming, by comparing the results of example, Newton derived the convergence rate faster and a smaller error than that of sub-interval method.