- 1、本文档共65页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
C fr Engineers an Scientists Frth Eitin工程师与科学家用C第四版
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * 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
文档评论(0)