In this paper, we give the cross rules of the discrete and confluent vector, topological and matrix ε-algorithms. Then, from the rules of these confluent algorithms, we derive non-Abelian lattice equations, in particular some extensions of the Lotka–Volterra system, in the style of the equation related to the confluent form of the scalar ε-algorithm.