第二章 非线性方程求根1.ppt

* 第二章 非线性方程求根 /* Solutions of Nonlinear Equations */ §1 多项式基础 /* Polynomials */ （自习） §2 二分法 /* Bisection Method */ 求 f (x) = 0 的根 原理：若 f ?C[a, b]，且 f (a) · f (b) 0，则 f 在 (a, b) 上必有一根。 §2 Bisection Method a b x1 x2 a b When to stop? 或 不能保证 x 的精度 x* ?2 x x* §2 Bisection Method 误差 分析： 第1步产生的 有误差 第 k 步产生的 xk 有误差 对于给定的精度 ? ,可估计二分法所需的步数 k ： ①简单; ② 对f (x) 要求不高(只要连续即可) . ①无法求复根及偶重根 ② 收敛慢 注：用二分法求根，最好先给出 f (x) 草图以确定根的大概位置。或用搜索程序，将[a, b]分为若干小区间，对每一个满足 f (ak)·f (bk) 0 的区间调用二分法程序，可找出区间[a, b]内的多个根，且不必要求 f (a)·f (b) 0 。 §2 Bisection Method Lab 02. Bisection Method Use the Bisection method to find on m given intervals the m real roots of a given polynomial of degree 5 ? n ? m, . Input There are several sets of inputs. For each set: The 1st line contains an integer n which is the degree of a polynomial. n = ?1 signals the end of file. The 2nd line contains n+1 real numbers which are the coefficients of the polynomial. The numbers are separated by spaces. The 3rd line contains an integer Max and two real numbers eps1 and eps2, where Max is the maximum number of iterations, eps1 is the accuracy bound for x and eps2 is the accuracy bound for p(x). The 4th line contains an integer m (n ? m ? 0), followed by m pairs of real numbers a1 b1 …am bm which are the end points of the intervals [ a1 , b1 ] …[ am , bm ]. Output? Each root is to be printed as in the C fprintf: fprintf(outfile, %12.7f?, root ); /* here ? represents a space */ If there is no root found in an interval, simply print “no?root?”. The output of the next set must be printed in a new line. Sample Input (? represents a space) 2 1?0??1 1000?002??2??0.5?0.5?2 3 1?0?0??1 1000?002??1?0?0?2 ?1 Sample Output (? represents a space) ???1.0000000????1.0000000? no?root????1.0000000? §2 Bisection Method ? 试位法 /* Regula Falsi Method */ a b (a+b)/2 x* (a, f (a)) (b, f (b)) Is it re