Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently
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 information of genotyped and non-genotyped animals. In contrast to ssGBLUP, SNP...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
BMC
2018-11-01
|
| Series: | Genetics Selection Evolution |
| Online Access: | http://link.springer.com/article/10.1186/s12711-018-0429-3 |
| _version_ | 1818279906651406336 |
|---|---|
| author | Jérémie Vandenplas Herwin Eding Mario P. L. Calus Cornelis Vuik |
| author_facet | Jérémie Vandenplas Herwin Eding Mario P. L. Calus Cornelis Vuik |
| author_sort | Jérémie Vandenplas |
| collection | DOAJ |
| description | 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 information 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 gradient (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 efficiency 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 ssPCBLUP 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 numbers, 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. |
| first_indexed | 2024-12-12T23:40:46Z |
| format | Article |
| id | doaj.art-2506b415fafb42dabe230343033c7b3e |
| institution | Directory Open Access Journal |
| issn | 1297-9686 |
| language | deu |
| last_indexed | 2024-12-12T23:40:46Z |
| publishDate | 2018-11-01 |
| publisher | BMC |
| record_format | Article |
| series | Genetics Selection Evolution |
| spelling | doaj.art-2506b415fafb42dabe230343033c7b3e2022-12-22T00:07:09ZdeuBMCGenetics Selection Evolution1297-96862018-11-0150111710.1186/s12711-018-0429-3Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficientlyJérémie Vandenplas0Herwin Eding1Mario P. L. Calus2Cornelis Vuik3Animal Breeding and Genomics Centre, Wageningen UR Livestock ResearchCRV BVAnimal Breeding and Genomics Centre, Wageningen UR Livestock ResearchDIAM, TU DelftAbstract 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 information 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 gradient (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 efficiency 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 ssPCBLUP 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 numbers, 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.http://link.springer.com/article/10.1186/s12711-018-0429-3 |
| spellingShingle | Jérémie Vandenplas Herwin Eding Mario P. L. Calus Cornelis Vuik Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently Genetics Selection Evolution |
| title | Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently |
| title_full | Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently |
| title_fullStr | Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently |
| title_full_unstemmed | Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently |
| title_short | Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently |
| title_sort | deflated preconditioned conjugate gradient method for solving single step blup models efficiently |
| url | http://link.springer.com/article/10.1186/s12711-018-0429-3 |
| work_keys_str_mv | AT jeremievandenplas deflatedpreconditionedconjugategradientmethodforsolvingsinglestepblupmodelsefficiently AT herwineding deflatedpreconditionedconjugategradientmethodforsolvingsinglestepblupmodelsefficiently AT marioplcalus deflatedpreconditionedconjugategradientmethodforsolvingsinglestepblupmodelsefficiently AT cornelisvuik deflatedpreconditionedconjugategradientmethodforsolvingsinglestepblupmodelsefficiently |