Solving large test-day models by iteration on data and preconditioned conjugate gradient.
A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.
Lidauer
M
M
Agricultural Research Centre, Jokioinen, Finland.
Strandén
I
I
Mäntysaari
E A
EA
Pösö
J
J
Kettunen
A
A
D000465:Algorithms; D000818:Animals; D001947:Breeding; D002417:Cattle / Q000235:genetics*; D005260:Female; D007774:Lactation / Q000235:genetics; D016014:Linear Models; D008297:Male; D008433:Mathematics; D008957:Models, Genetic; D012044:Regression Analysis; D012984:Software