Convergence globalization

The results of the two groups Thielemann-Nomoto and Woosley-Weaver do converge globally speaking, but differ in the details (see Table A4.2). This is because they use different reaction probabilities and different algorithms for the mathematical treatment of convection within stars. 

The interval length converges globally to zero and the convergence is at least linear with a rate less than i.e. 

Auxiliary subroutines for handling coordinate transformation between local and global systems, quadrature, convergence checking and updating of physical parameters in non-linear calculations. 

Fig. 10-6 Global map of major ocean currents. AND = ARC = Arctic convergence.

J.H. Wilkinson, Global convergence of tridiagonal QR algorithm with origin shift. Algorithms Applic., 1 (1968)409 20. 

In this problem it is very difficult to obtain convergence to the global optimum as the condition number of matrix A at the above local optimum is 3xl018. Even if this was the global optimum, a small change in the data would result in widely different parameter estimates since this parameter estimation problem appears to be fairly ill-conditioned. 

---