2 Solutions of Equations in One Variable-Numerical Analysis,Burden.pptVIP

下载本文档

5
0
约4.39千字
约 41页
2016-11-27 发布于河南
举报
版权申诉

2 Solutions of Equations in One Variable-Numerical Analysis,Burden.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

2 Solutions of Equations in One Variable-Numerical Analysis,Burden

Ch2 Solutions of Equations in One Variable 2.1 The Bisection Methods Algorithm of Bisection Convergence Theorem Suppose that f∈C[a,b] and f(a)?f(b)0,then the Bisection methods generates a sequence xn approximating a zero p of f with: | xn -x|≤ (b-a)/2n Proof: | bn - an |=(b-a)/2n-1 ， xn , x ∈ (an , bn) 2.2 Fixed-Point Iteration (Example) Theorem 2.2 (two propositions) (existence 、uniqueness error estimation) Proof Moreover, Example　Solve: Solution:　　　x=solve(‘exp(-x)=sin(pi*x/2)’) (or solve(‘exp(-x)-sin(pi*x/2)’)) Return gives：　　　x= 　　　　.44357353410429277965457309417668 (32-figure)　　　　　　　　 2.3 Newton’s Method---An important iteration Secant Method (2-step method) Geometry Describe Method of False Position(Regula Falsi) 2.4 Convergence Order for Iterative Methods The convergence rate of bisection The convergence rate of secant method 2.5 Steffensen Accelerating Convergence Zero of multiplicity 2.5* 解非线性方程组的Newton迭代法 2.6 最速下降迭代法（规划法）解非线性方程组 In this case, Newton methods is of formal , for f’(x* ) =0, the rate of convergence is lower! 据此抽出不动点形式，进而构造Newton迭代公式： * 2.1 The Bisection Methods 2.2 Fixed –Point Iteration 2.3 Newton’s Methods 2.4 Error Analysis for Iterative 2.5 Accelerating Convergence 2.6* Zeros of Polynomials Müllers Method The problem of finding an approximation to the root of an equation (f(x)=0)can be traced back at least as far as 1700 B.C. A cuneiform table in the Yale Babylonian Collection dating from that period gives a sexigesimal (base-60) number equivalent to 1.414222 as an approximation to 2?. Based on the Intermediate Value Theorem, the first technique is Bisection,or Binary-search,method. To find a solution to f(x)=0 given the continuous function f on the interval [a,b],where f(a) and f(b) have opposite signs. A Related Algorithm:Method of false position INPUT a, b; TOL ; N (maximum number of iteration).OUTPUT approximation solution x or message of failure.Step 1 Set