Skip to main content
SpringerLink
Log in

On the computation of breeding values

  • Algorithms For Matrix Factorization
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 457))

Abstract

A model and estimation procedure is presented to estimate breeding values. Algorithms for Sparse QR-factorization on the CRAY X/MP are derived and implemented. Finally an adapted ordering is found, which has some advantages compared with minimum degree ordering. The fill-in for practical problems could be computed explicitly for a large part of the algorithm. The nonzero structure of the R-factor of a practical example is supplied.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Å. Björck, Least squares methods, in HANDBOOK OF NUMERICAL ANALYSIS, Vol.1: Solution of Equations in R n, P. Ciarlet and J. Lions, eds., Elsevier/North Holland, 1989.

    Google Scholar 

  2. A. George and M. T. Heath, Solution of sparse linear least squares problems using givens rotations, Linear Algebra and its Applications, 34 (1980), pp. 69–83.

    Article  Google Scholar 

  3. A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, 1981.

    Google Scholar 

  4. A. George and J. W. Liu, The evolution of the minimum degree ordering algorithm, SIAM Review, 31 (1989), pp. 1–19.

    Article  Google Scholar 

  5. P. M. G.H. Golub and P. L. Toint, A comparison between some direct and iterative methods for certain large scale geodetic least squares problems, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 799–816.

    Article  Google Scholar 

  6. C. Henderson, Sire evaluation and genetic trends, in Proc. Anim. Breed. and Genet. Symp. in Honor of Dr. J.L. Lush, Champaign, Illinois, 1973, American Society of Animal Science and American Diary Science Association.

    Google Scholar 

  7. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Series in Automatic Computation, Prentice-Hall, 1974.

    Google Scholar 

  8. J. Lewis and H. Simon, The impact of hardware gather/scatter on sparse gaussian elimination, SIAM J. Sci. Stat. Comput., 9 (1988), pp. 304–311.

    Article  Google Scholar 

  9. A. Pothen and P. Raghavan, Distributed orthogonal factorization: Givens and householder algorithms, SIAM J. Sci. Stat. Comput., 10 (1989), pp. 1113–1134.

    Article  Google Scholar 

  10. A. Sameh and Z. Zlatev, Solving general sparse linear systems using conjugate gradient-type methods, Tech. Rep. 895, Center for Supercomputing Research and Development, University of Illinois, 1989.

    Google Scholar 

  11. G. Wiggans, I. Misztal, and L. Van Vleck, Implementation of an animal model for genetic evaluation of dairy cattle in the united states, J. Dairy Science, 71, suppl. 2 (1988), pp. 54–69.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Interdisciplinary Project Center for Supercomputing, ETH-Zürich ETH-Zentrum, CH-8092, Zürich

    Markus Hegland

Authors
  1. Markus Hegland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hegland, M. (1990). On the computation of breeding values. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation