Figure 4 Plots for E-values of CM-II5 and NLMs for m > 5
Related Figures (13)
Fig. 5 Plots for E-values of GMs and NLMs for m > 10 Fig. 6 Plots for E-values of CM-Ig and NLMg for m > 14 6 Numerical results Fig. 8 Plots for E-values of NUMs5 and NLMg for m > 28 Fig. 7 Plots for E-values of CM-II¢ and NLMg for m > 12 Table 1 Performance of methods for Example 1 Table 2 Performance of methods for Example 2 Table 3. Performance of methods for Example 3 Table 4 Performance of methods for Example 4 Table 5 Performance of methods for Example 5 From the numerical results, it can be observed that like the existing methods the present methods show consistent convergence behavior. It is also clear that the computational order of convergence overwhelmingly supports the theoretical order of convergence. The existing method GMs by Grau et al. converges to the solution with sixth order of convergence in third problem. Efficiency in this exceptional case, therefore, is E = 6!/°/? ~ 1.0026699. Table 6 Performance of methods for Example 6 Numerical values of the efficiency indices displayed in the penultimate column of Tables 1, 2, 3,4, 5 and 6 also verify the results of Theorem 3. As we know that the computational efficiency is proportional to the reciprocal value of the total CPU time necessary to complete running iterative process. So, the method with high efficiency utilizes less CPU time than the method with low efficiency. This fact can be judged from the numerical values of computational efficiency and computing time displayed in the last two columns of the tables. Thus, the efficiency results are in agreement with the CPU time utilized in the execution of program.
