Transformed Mixed Model Equations: A Recursive Algorithm to Eliminate A−1

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

For Henderson's L defined such that LL′ = A, a numerator relationship matrix, a recursive algorithm is derived to overwrite a matrix B with L′B or, for square B, with L′BL working directly from a list of sires and dams (or maternal grandsires). The matrix L is never computed. Matrices so formed have application in procedures that use mixed model equations for estimating variance components. © 1989, American Dairy Science Association. All rights reserved.

Cite

CITATION STYLE

APA

Quaas, R. L. (1989). Transformed Mixed Model Equations: A Recursive Algorithm to Eliminate A−1. Journal of Dairy Science, 72(7), 1937–1941. https://doi.org/10.3168/jds.S0022-0302(89)79314-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free