We introduce an efficient method for computing matrix products of the formY=AXB, whereA andB are sparse and constant. We analyze the complexity of the method, develop quantitative criteria for determining when it can be used effectively, and demonstrate its use in a Kalman filter.