5/28/2023 0 Comments Fortran program for secant methodEven when an explicit expression for the derivative is known, the evaluation of these two distinct functions during each iteration is computationally expensive. However, as we have previously noted, the Newton-Raphson method requires an evaluation of both f( x n) and f′( x n) during each iteration. While it is possible to prove this with an analysis of the convergence speeds, this is beyond the scope of this book and we take this fact from observations of the above examples. Four roots are found over the full interval −5,5, x r ≃ ± x 5 1 = ± 1.26027 and x r ≃ ± x 6 2 = ± 2.67672. ![]() ![]() Equation ( 13.7) can then be applied for both sets of initial data, as shown in Table 13.12.
0 Comments
Leave a Reply. |