This correspondence presents an evaluation of multiple-reference adaptive algorithms. Two LMS-types and a Newton-type algorithm are considered. The special structure of the adaptive filtering problem implies that the Newton-type algorithm can be implemented with the same numerical complexity as LMS-type algorithms. The concept of a fast filtered-x Newton algorithm is thus introduced.