JDS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


Journal of Dairy Science Vol. 72 No. 2 514-522
© 1989 by American Dairy Science Association ®
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Berger, P. J.
Right arrow Articles by Hoekstra, J. A.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Berger, P. J.
Right arrow Articles by Hoekstra, J. A.

Iterative Algorithms for Solving Mixed Model Equations1

P. J. Berger1, G. R. Luecke2 and J. A. Hoekstra3

Iowa State University, Ames 50011

ABSTRACT

Iterative algorithms for obtaining solutions for sire effects and breeding value estimates from progeny with records in mixed model procedures were compared. Successive overrelaxation with adaptive acceleration and a Jacobi conjugate gradient method seem to be more generally useful for two general areas of interest: 1) sire evaluation models, where some effects are absorbed; and 2) reduced animal models, where no effects are absorbed. An inverse of the relationship matrix may be included as part of the coefficient matrix and its inclusion will not prevent convergence. Key features include: 1) scaling the equations so that all diagonal elements are 1 and the scaled coefficient matrix remains real, symmetric, and positive definite; 2) calculation of a new relaxation parameter during run time to approximate the value that will yield fastest convergence; 3) calculation of a new relaxation parameter after convergence begins to slow down; and 4) use of numerically accurate and efficient convergence criteria. The Jacobi conjugate gradient method was 55% more efficient than successive overrelaxation in solving reduced animal model equations of order 3356. Number of iterations and total execution times for all iterations were: 83, 2.89 s and 169, 6.44 s, respectively. Another reduced animal model application with equations of order 38,139 converged in 38 s (50 iterations) using successive overrelaxation. Solutions for sire equations constrained to full rank converged more quickly than unconstrained equations.


FOOTNOTES

1 Journal Paper Number J-12774 of the Iowa Agriculture and Home Economics Experiment Station, Ames. Project Number 2721.

2 Department of Animal Science.

3 Department of Mathematics.

4 Computation Center.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 1989 by the American Dairy Science Association ®.