C fr Engineers an Scientists Frth Eitin工程师与科学家用C第四版.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Two characteristics of this type of computation: Round-off errors occur when the values of f(x1) and f(x3) are nearly equal Prediction of exact number of iterations is not available Excessive and possibly infinite iterations must be prevented Excessive computation time might be a problem Occurs if number of iterations exceeds fifty Common Programming Errors * C++ for Engineers and Scientists, Fourth Edition All root solving methods described in chapter are iterative Can be categorized into two classes Starting from an interval containing a root Starting from an initial estimate of a root Bisection algorithms refine initial interval by: Repeated evaluation of function at points within interval Monitoring the sign of the function and determining in which subinterval the root lies Summary * C++ for Engineers and Scientists, Fourth Edition Regula falsi uses same conditions as bisection method Straight line connecting points at the ends of the intervals is used to interpolate position of root Intersection of this line with x-axis determines value of x2 used in next step Modified regula falsi same as regula falsi except: In each iteration, when full interval replaced by subinterval containing root, relaxation factor used to modify function’s value at the fixed end of the subinterval Summary (continued) * C++ for Engineers and Scientists, Fourth Edition Secant method replaces the function by: Secant line through two points Finds point of intersection of the line with x-axis Algorithm requires two input numbers: x0 and ?x0 Pair of values then replaced by pair (x1, and ?x1) where x1 = x0 + ?x0 and Summary (continued) * C++ for Engineers and Scientists, Fourth Edition Secant method processing continues until ?x is sufficiently small Success of a program in finding the root of function usually depends on the quality of information supplied by the user Accuracy of initial guess or search interv