Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently

Jérémie Vandenplas, Herwin Eding, Mario P.L. Calus, Cornelis Vuik

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)
14 Downloads (Pure)

Abstract

Background:
The single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) method, such as single-step genomic BLUP (ssGBLUP), simultaneously analyses phenotypic, pedigree, and genomic informa-
tion of genotyped and non-genotyped animals. In contrast to ssGBLUP, SNP effects are fitted explicitly as random effects in the ssSNPBLUP model. Similarly, principal components associated with the genomic information can be
fitted explicitly as random effects in a single-step principal component BLUP (ssPCBLUP) model to remove noise in genomic information. Single-step genomic BLUP is solved efficiently by using the preconditioned conjugate gradi-
ent (PCG) method. Unfortunately, convergence issues have been reported when solving ssSNPBLUP by using PCG. Poor convergence may be linked with poor spectral condition numbers of the preconditioned coefficient matrices of
ssSNPBLUP. These condition numbers, and thus convergence, could be improved through the deflated PCG (DPCG) method, which is a two-level PCG method for ill-conditioned linear systems. Therefore, the first aim of this study was
to compare the properties of the preconditioned coefficient matrices of ssGBLUP and ssSNPBLUP, and to document convergence patterns that are obtained with the PCG method. The second aim was to implement and test the effi-
ciency of a DPCG method for solving ssSNPBLUP and ssPCBLUP.

Results:For two dairy cattle datasets, the smallest eigenvalues obtained for ssSNPBLUP (ssPCBLUP) and ssGBLUP, both solved with the PCG method, were similar. However, the largest eigenvalues obtained for ssSNPBLUP and ssPCB-
LUP were larger than those for ssGBLUP, which resulted in larger condition numbers and in slow convergence for both systems solved by the PCG method. Different implementations of the DPCG method led to smaller condition num-
bers, and faster convergence for ssSNPBLUP and for ssPCBLUP, by deflating the largest unfavourable eigenvalues.

Conclusions:
Poor convergence of ssSNPBLUP and ssPCBLUP when solved by the PCG method are related to larger eigenvalues and larger condition numbers in comparison to ssGBLUP. These convergence issues were solved with a DPCG method that annihilates the effect of the largest unfavourable eigenvalues of the preconditioned coefficient matrix of ssSNPBLUP and of ssPCBLUP on the convergence of the PCG method. It resulted in a convergence pattern,
at least, similar to that of ssGBLUP.
Original languageEnglish
Pages (from-to)1-17
Number of pages17
JournalGenetics Selection Evolution
Volume50
Issue number51
DOIs
Publication statusPublished - 2018

Fingerprint Dive into the research topics of 'Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently'. Together they form a unique fingerprint.

  • Cite this