It proceeds by evaluating certain integrals along g numerically and is based on the theory of formal orthogonal polynomials. The algorithm requires only f and not its first derivative f'. We have found that it gives accurate approximations for the zeros. Moreover, it is self-starting in the sense that it does not require initial approximations. The algorithm works for simple zeros as well as multiple zeros, although it is unable to compute the multiplicity of a zero explicitely.
Numerical examples illustrate the effectiveness of our approach.