HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Jensen, J. Articles by Mao, I. L. Search for Related Content PubMed Articles by Jensen, J. Articles by Mao, I. L.

Transformation Algorithms in Analysis of Single Trait and of Multitrait Models with Equal Design Matrices and One Random Factor per Trait: A Review¹

Michigan State University, East Lansing 48824-1225

Abstract

Transformation algorithms for models with two variance components per trait are reviewed and illustrated with a numerical example. The emphasis is on multiple trait models with equal design matrices. Algorithms of canonical, "Cholesky," and Householder transformations are discussed. The series of transformations offers an alternative that drastically reduces the amount of computation per round of the iterative expectation maximization algorithm for estimating (co)variance components by the restricted maximum likelihood method. After all the transformations are carried out, no matrices need to be inverted and the computations in each round of the iteration process can be evaluated in linear time. Thus, in practice, after the initial computing work is done, any number of iterations can be performed with ease. This allows the use of conservative stopping criteria. The stopping criteria often need to be conservative because considerable changes in parameter estimates can occur during later rounds of the iteration process, even though the change per round is very small.

¹ Michigan Agric. Exp. Sta. Journal Article No. 12472.

² Dept. of Anim. Sci., Michigan State Univ.

³ On leave from the Natl. Inst. of Anim. Sci. in Denmark. Financial support from the Danish Agric. and Vet. Res. Council is appreciated.

⁴ To whom request for reprints should be addressed.