说明：  先确定方程 的一个收敛的有根区间[a,b], 然后用不动点迭代法在此有根区间的近似根,初值 自己确定,要求根精确到 ,再比较用二分法的二分次数、不动点迭代法、Aitken迭代加速法的迭代次数. （要求：使用函数式文件调用）
(First determine a convergence of the equation with the root interval [a, b], and then use the fixed point iteration method to have the approximate root of the root interval, the initial value is determined by itself, the root is required to be accurate, and then the number of iterations of the two points, the fixed point iteration and the Aitken iterative acceleration method is compared. (request: using the function file call))