apply the method of bisectIon to compute sqr3

2008-06-24 9:32 pm
1. apply the method of bisection to compute sqr3

2. DETERMINE A NUMBER N OF STEPS SUFFICIENT TO COMPUTE SQR3 BY THE METHOD OF BISECTION TO TWELVE SIGNIFICANT DIGITS

回答 (2)

2008-06-25 12:41 am
✔ 最佳答案
(1) Consider the positive root of f(x) = x2 - 3 = 0, we start the iteration from the range 1 < x < 2 since f(1) < 0 and f(2) > 0 as follows:

圖片參考:http://i117.photobucket.com/albums/o61/billy_hywung/Jun08/Crazynumeric1.jpg

So, corr. to 4 sig. fig., square root of 3 is 1.732.
(2) To give a 12 sig. fig. value, it should be 11 decimal places and therefore, the criteria should be, when assuming that n steps of bisection is required:
(1/2)n < 0.5 x 10-11
(1/2)n-1 < 10-11
- (n - 1) log 2 < -11
(n - 1) log 2 > 11
n - 1 > 11/log 2 = 36.5
n > 37.5
n = 38.
So 38 steps of bisection is needed.
參考: My Maths knowledge
2008-06-25 12:07 am
係唔係要由
x^3+x^2+x^1+C = 0
變成(x+a)(x+b)(x+c)=0??


收錄日期: 2021-04-16 22:45:46
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20080624000051KK01011

檢視 Wayback Machine 備份