Inversion of a part of the numerator relationship matrix using pedigree information

BACKGROUND: In recent theoretical developments, the information available (e.g. genotypes) divides the original population into two groups: animals with this information (selected animals) and animals without this information (excluded animals). These developments require inversion of the part of the pedigree-based numerator relationship matrix that describes the genetic covariance between selected animals (A(22)). Our main objective was to propose and evaluate methodology that takes advantage of any potential sparsity in the inverse of A(22) in order to reduce the computing time required for its inversion. This potential sparsity is brought out by searching the pedigree for dependencies between the selected animals. Jointly, we expected distant ancestors to provide relationship ties that increase the density of matrix A(22) but that their effect on [Formula: see text] might be minor. This hypothesis was also tested. METHODS: The inverse of A(22) can be computed from the inverse of the triangular factor (T(-1)) obtained by Cholesky root-free decomposition of A(22). We propose an algorithm that sets up the sparsity pattern of T(-1) using pedigree information. This algorithm provides positions of the elements of T(-1) worth to be computed (i.e. different from zero). A recursive computation of [Formula: see text] is then achieved with or without information on the sparsity pattern and time required for each computation was recorded. For three numbers of selected animals (4000; 8000 and 12 000), A(22) was computed using different pedigree extractions and the closeness of the resulting [Formula: see text] to the inverse computed using the fully extracted pedigree was measured by an appropriate norm. RESULTS: The use of prior information on the sparsity of T(-1) decreased the computing time for inversion by a factor of 1.73 on average. Computational issues and practical uses of the different algorithms were discussed. Cases involving more than 12 000 selected animals were considered. Inclusion of 10 generations was determined to be sufficient when computing A(22). CONCLUSIONS: Depending on the size and structure of the selected sub-population, gains in time to compute [Formula: see text] are possible and these gains may increase as the number of selected animals increases. Given the sequential nature of most computational steps, the proposed algorithm can benefit from optimization and may be convenient for genomic evaluations.