where μ and μ2 are the true first and second moments and E[x2] is the empirical second moment.
The algorithm starts with the estimate p=E[x2] as an upper bound. However, in step 2 of section 4.2, the p component is estimated as the difference between the numerical integration of x2f(x) and the empirical second moment---p=E[x2]−∫x2f(x)dx---as seen in equation (4.3). This is converted to g by reciprocation and convergence is tested by the difference between this new g and its prior value. If the new p≤0, the algorithm attempts to restart with a larger g---a smaller p. In this case, the algorithm tends to fail to converge.
Returns
Returns a list containing: - g: The fitted g parameter.
b: The fitted b parameter.
iter: The number of iterations used.
sqerr: The squared error between the empirical mean and the theoretical mean given the fitted g and b.
Note
Anecdotal evidence indicates that the results of this fitting algorithm can be volatile, especially with fewer than a few hundred observations.
References
Bernegger, S. (1997) The Swiss Re Exposure Curves and the MBBEFD
Distribution Class. ASTIN Bulletin 27 (1), 99--111. tools:::Rd_expr_doi("10.2143/AST.27.1.563208")