Computing the Diagonal Elements and Inverse of a Large Numerator Relationship Matrix

Abstract

A procedure is presented for rapidly computing the diagonal elements of a large numerator relationship matrix, say A. It also generates a lower triangular matrix, say L, defined such that LL' = A. Given the diagonal elements of L, A-1 may be easily computed from a list of sires and dams.