Figure 6: Frequency graph for the
iron-chromium test case
Comparison of CPU times and failure
ratios
As expected, the CPU times for one iteration loop increase as the number
of species increases in the test case and as the complexity of the
algorithm increases (see Table 4). We show that the outer fixed-point
algorithm is the fastest and that the full Newton algorithm is the
slowest. Moreover, the recursive formulation of the full Newton
algorithm is the slowest. For this reason, we strongly recommend not
using the recursive formulation, and we prefer the explicit formulation.
Table 4: CPU times for 1 loop (ms)