HE basic idea of tHE method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that tHEre is at least one root of tHE function f(x) within tHE initial interval.) We tHEn iteratively bisect tHE interval, generating a sequence of intervals [ak,bk] that is guaranteed to converge to a solution to f(x) = 0.
標簽:
bisection
interval
initial
method
上傳時間:
2017-04-29
上傳用戶:zsjinju