Exercse-2014F-2-Answer.docVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Exercise-2 for Numerical Methods (P50(1))Determine rigorously if each function has a unique fixed point on the given interval. g(x)= 1-x2/4 on [0,1]; Solution: g(x)=1/x on [0.5,5.2]. Solution:(P85(1))Let f(x)= x2-x+2. Find the Newton-Raphson formula pk=g(pk-1). Solution: Start with p0=-1.5 and find p1,p2, and p3. Solution: Matlab Exercises: (P51(1))Use the program of fixed point iteration to approximate the fixed points (if any) of each function. Produce a graph of each function and the line y=x that clearly shows any fixed points. g(x)=x5-3x3-2x2+2; g(x)=cos(sin(x)); g(x)=x2-sin(x+0.15); g(x)=xx-cos(x) Solution: (a) See the programs in the M-files. The result is the following: P =0, 2, 2 k =3 p =2 err =0 Actually, at least there are two other roots for this equation as shown in the following plot: (b) See the programs in the M-files. The result is the following: P =0 1.0000 0.6664 0.8150 0.7467 0.7781 0.7636 0.7703 0.7672 0.7686 0.7680 0.7683 0.7681 0.7682 0.7682 0.7682 0.7682 k = 17 p = 0.7682 err =6.1856e-006(c) See the programs in the M-files. The result is the following: Choose p0=1.5, tol=0.00001, and maxNum=100. The iterations cannot converge: 1. We got an error message “maximum number of iterations exceeded”. 2. The last points are P =…. 0.3234 -0.3513 0.3234 -0.3513 0.3234 -0.3513 0.3234 -0.3513 0.3234 -0.3513 The data show that the iterations oscillate between 0.3234 and -0.3513. 3. err =0.6747Choosing p0=0.5, we got the similar result: k =100; p =-0.3513; err =0.6747; P =0.5000 -0.3552 0.3299 … -0.3513 0.3234 -0.3513 0.3234 -0.3513(d) See the programs in the M-files. The result is the following: Choose p0=1.2, tol=0.00001, and maxNum=20. It is convergent. k =17; p =1.0000; err =7.9231e-006 P =1.2000 1.1650 1.1248 1.0850 … 1.0033 1.0015 1.0007 1.0003 1.0002 1.0001 1.0000 1.0000 1.0000 (P87(22))Halley’s method is a way to speed up convergence of Newton-Raphson method. Do programming for the two methods and

文档评论(0)

fpiaovxingl + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档