![]() ![]() We can check our result by solving our quadratic equations in a classic way: \[ \begin\\ This means that the value that approximates best the root of the function f is the last value of c = 3.1611328. The result shown that we need at least 9 iterations (the integer of 9.45) to converge the solution within the predefined tolerance, which is exactly how many iterations our algorithm performed. The Bisection Method is a simple root finding method, easy to implement and very robust.
0 Comments
Leave a Reply. |