工程数学课件.docVIP

一、Bracketing Methods the method starts with two initial guesses (xl,xu) that bracket, or contain, the root. Then systematically reduce the width of the bracket. If f(xl) and f(xu) have opposite signs, there are an odd number of roots in the interval; If f(xl) and f(xu) have the same signs, there are either no roots or an even number of roots between the values. The Bisection Method General Principle---If f(x) is real and continuous in the interval from xl to xu and f(xl) and f(xu) have opposite sigs, that is f(xl)f(xu)0, then there is at least one real root between xl and xu. Step1: Choose lower xl and upper xu guesses for the root that the function changes sign over the interval. This can be checked by ensuring that f(xl)f(xu)0; Step2: An estimate of the root xr is determined by Xr=(xl+xu)/2 (this approach always divide the interval in half) ?? Step3: Make the following evaluations to determine in which interval the root lies: If f(xl)f(xr)0, the root lies in the lower subinterval. Therefore, set xu=xr and return to step 2. If If f(xl)f(xr)0, the root lies in the upper subinterval. Therefore, set xl=xr and return to step 2. If f(xl)f(xr)=0, the root equals xr; terminates the computation Termination criteria and error estimates： The False-position Method This method determines xr using the following approaches: Step1: Choose lower xl and upper xu guesses for the root that the function changes sign over the interval. This can be checked by ensuring that f(xl)f(xu)0; Step2: An estimate of the root xr is determined by Equation (2) ?? Step3: Make the following evaluations to determine in which interval the root lies: If f(xl)f(xr)0, the root lies in the lower subinterval. Therefore, set xu=xr and return to step 2. If If f(xl)f(xr)0, the root lies in the upper subinterval. Therefore, set xl=xr and return to step 2. If f(xl)f(xr)=0, the root equals xr; terminates the computation Open Methods 1、Newton-Raphson Method—the most widely used of all root-locating formulas Pi