Newton's iteration for square roots
Quadratic convergence means that the square of the error at one iteration is proportional to the error at the next iteration
Another interesting feature of the Newton iteration is that all iterations (except possibly the initial guess) are above the ultimate square root. This is obvious from equation (2).
We can insert spectral functions in the Newton square-root iteration, for example and .Where the first guess a0 happens to match ,it will match at all iterations. Something inspires Wilson to write the Newton iteration as
Now we are ready for the algorithm: Compute the right side of (4) by polynomial division forwards and backwards and then add 1. Then abandon negative lags and take half of the zero lag. Now you have At+1(Z) / At(Z). Multiply out (convolve) the denominator At(Z), and you have the desired result At+1(Z). Iterate as long as you wish.
We show that At+1(Z) is minimum phase: Both sides of (4) are positive, as noted earlier. Both terms on the right are positive. Since the Newton iteration always overestimates, the 1 dominates the rightmost term. After masking off the negative powers of Z (and half the zero power), the right side of (4) adds two wavelets. The 1/2 is wholly real, and hence its real part always dominates the real part of the rightmost term. Thus (after masking negative powers) the wavelet on the right side of (4) has a positive real part, so the phase cannot loop about the origin. This wavelet multiplies At(Z) to give the final wavelet At+1(Z) and the product of two minimum-phase wavelets is minimum phase.
Claerbout is interested in factoring the Laplacian
Burg is interested in extending the Wilson algorithm to cross spectra.