
requires an approximation of the smallest l
. The approximation is obtained from a step of inverse iteration applied to a heuristically chosen starting matrix. In the style of LINPACK, the cost of the estimator is kept down by using the same matrix factorizatlons to make the estimate as are used to solve
. Computational experiments verify its reliability.