  We introduce a decomposition of associative algebras into a tensor product of
cyclic modules. This produces a means to encode a basis with logarithmic
information and thus extends the reach of calculation with large algebras. Our
technique is an analogue to the Schreier-Sims algorithm for permutation groups
and is a by-product of Frobenius reciprocity.
