  We study the properties of ultrametric matrices aiming to design methods for
fast ultrametric matrix-vector multiplication. We show how to encode such a
matrix as a tree structure in quadratic time and demonstrate how to use the
resulting representation to perform matrix-vector multiplications in linear
time. Accompanying this article, we provide an implementation of the proposed
algorithms and present empirical results on their practical performance.
