Interestingly, bootstrap replicates that required a large number of iterations to reach convergence in one stage converged quite quickly in the next stage, and vice versa.
In particular, the IDEAL algorithm can reach convergence, whereas the SIMPLE and SIMPLEC algorithms cannot obtain convergent solution in some cases.
To reach convergence up to this level, we need at least 20 decimal places.
However, in this case, to reach convergence in the iterations is rather complicated.
In some cases, Bulirsch-Stoer tolerances of 10−100 are needed to reach convergence.
We take iterations for the two parts until the results reach convergence.
Figure 18 Number of iterations per subcarrier per base station to reach convergence in the proposed algorithms.
When the density combinations are not optimal the inversion process does not reach convergence or the misfit is large.
However, problems with highly nonlinear characteristic curves often require many sweeps to reach convergence, and ordered methods then perform better.
A novel formulation of the ion flow rate is proposed here that reduces the computing effort to reach convergence by a factor of 10 or more.
During the convergence test, only the horizontally incident cases are checked because they take more truncation terms than others to reach convergence.
