Skip to main content
Article thumbnail
Location of Repository

Iterative Algorithms for Solving Mixed Model Equations

By P. J. Berger, G. R. Luecke and J. A. Hoekstra


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) calcula-tion of a new relaxation parameter after convergence begins to slow down; and 4) use of numerically accurate and efficient convergence criteria. The Jacobi conju-gate gradient method was 55 % more efficient than successive overrelaxation in solving reduced animal model equation

Year: 1989
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.