A Ulm-like method is proposed in [13] for solving inverse eigenvalue problems with distinct given eigenvalues. The Ulm-like method avoids solving the Jacobian equations used in Newton-like methods and is shown to be quadratically convergent in the root sense. However, the numerical experiments in [3] only show that the Ulm-like method is comparable to the inexact Newton-like method. In this short note, we give a numerical example to show that the Ulm-like method is better than the inexact Newton-like method in terms of convergence neighborhoods.