The recursive algorithm is implemented using the following steps.

- Make initial estimates and .
- Solve equation () for and
using the first three measurements, , and
and with
*N*=3. - Obtain the new estimates of
*A*and by forming and . If either value of*A*or is negative, then use the previous value. - Measure the next data point, increment
*N*, and evaluate in () and in () for using the new values for*A*and . - Solve equation () for and , and go to step 3 until the stopping criteria is reached.

A variation of the above algorithm is to always use the initial values and in the equations (), (), (), resulting in a much simpler implementation with less real-time computation. However, convergence of this variation is much more dependent on the choice of initial conditions. Students can investigate this tradeoff between computational complexity and convergence.

Fri Jun 21 11:03:19 EDT 1996