Canonical analysis of two convex polyhedral cones involves looking for two vectors whose square cosine is a maximum. New results about the properties of the optimal solution to this problem are presented. The convergence of an alternating least squares algorithm and properties of limits of calculated sequences are discussed. (SLD)