Muller's method is a recursive method which generates an approximation of the root ξ of f at each iteration.

The backstepping approach provides a recursive method for stabilizing the origin of a system in strict-feedback form.

In numerical analysis, the Clenshaw algorithm is a recursive method to evaluate a linear combination of Chebyshev polynomials.

This is a recursive method that decomposes a given tree into a bunch of paths.

It is based on the mathematics of the Tower of Hanoi puzzle, with what is essentially a recursive method.

There are several recursive methods for computing square numbers.

Divisibility by 7 can be tested by a recursive method.

A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems.

A simpler recursive method rebuilds the list each time (rather than splicing) and can use O(n) stack space.

Thus a recursive method is desired where the new measurements can modify the old estimates.