Application of supernodal sparse factorization and inversion to the estimation of (co)variance components by residual maximum likelihood.

We demonstrated that supernodal techniques were more efficient than traditional methods for factorization and inversion of a coefficient matrix of mixed model equations (MME), which are often required in residual maximum likelihood (REML). Supernodal left-looking and inverse multifrontal algorithms were employed for sparse factorization and inversion, respectively. The approximate minimum degree or multilevel nested dissection was used for ordering. A new computer package, Yet Another MME Solver (YAMS), was developed and compared with FSPAK with respect to computing time and size of temporary memory for 13 test matrices. The matrices were produced by fitting animal models to dairy data and by using simulations from sire, sire-maternal grand sire, maternal and dominance models for phenotypic data and animal model for genomic data. The order of matrices ranged from 32,840 to 1,048,872. The YAMS software factorized and inverted the matrices up to 13 and 10 times faster than FSPAK, respectively, when an appropriate ordering strategy was applied. The YAMS package required at most 282 MB and 512 MB of temporary memory for factorization and inversion, respectively. Processing time per iteration in average information REML was reduced, using YAMS. The YAMS package is freely available on request by contacting the corresponding author.

[1]  Robert A. van de Geijn,et al.  High-performance implementation of the level-3 BLAS , 2008, TOMS.

[2]  Mehdi Sargolzaei,et al.  QMSim: a large-scale genome simulator for livestock , 2009, Bioinform..

[3]  S. P. Smith Differentiation of the Cholesky Algorithm , 1995 .

[4]  YANQING CHEN,et al.  Algorithm 8 xx : CHOLMOD , supernodal sparse Cholesky factorization and update / downdate ∗ , 2006 .

[5]  Patrick Amestoy,et al.  A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling , 2001, SIAM J. Matrix Anal. Appl..

[6]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[7]  Barry W. Peyton,et al.  Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers , 1991, SIAM J. Sci. Comput..

[8]  I Misztal,et al.  Reliable computing in estimation of variance components. , 2008, Journal of animal breeding and genetics = Zeitschrift fur Tierzuchtung und Zuchtungsbiologie.

[9]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[10]  I Misztal,et al.  Hot topic: a unified approach to utilize phenotypic, full pedigree, and genomic information for genetic evaluation of Holstein final score. , 2010, Journal of dairy science.

[11]  Y. Atagi,et al.  Genetic characteristics of Japanese Holstein cows based on multiple-lactation random regression test-day animal models , 2008 .

[12]  E Weinan,et al.  A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations , 2010, SIAM J. Sci. Comput..

[13]  Miguel Pérez-Enciso,et al.  Sparse Matrix Inversion for Restricted Maximum Likelihood Estimation of Variance Components by Expectation-Maximization , 1993 .

[14]  W. F. Tinney,et al.  On computing certain elements of the inverse of a sparse matrix , 1975, Commun. ACM.

[15]  Nicholas I. M. Gould,et al.  A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations , 2007, TOMS.

[16]  Joseph W. H. Liu,et al.  On Finding Supernodes for Sparse Matrix Computations , 1993, SIAM J. Matrix Anal. Appl..

[17]  Lexing Ying,et al.  SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix , 2011, TOMS.

[18]  Timothy A. Davis,et al.  Multifrontal algorithms for sparse inverse subsets and incomplete lu factorization , 1995 .

[19]  A. Hofer,et al.  Variance component estimation in animal breeding: a review† , 1998 .

[20]  Anoop Gupta,et al.  An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines , 1991, Int. J. High Speed Comput..

[21]  Barry W. Peyton,et al.  A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors , 1991, SIAM J. Sci. Comput..