  We examine several of the normal-form multivariate polynomial rootfinding
methods of Telen, Mourrain, and Van Barel and some variants of those methods.
We analyze the performance of these variants in terms of their asymptotic
temporal complexity as well as speed and accuracy on a wide range of numerical
experiments. All variants of the algorithm are problematic for systems in which
many roots are very close together. We analyze performance on one such system
in detail, namely the 'devastating example' that Noferini and Townsend used to
demonstrate instability of resultant-based methods.
