Abstract
Computational requirements for sparse matrix factorisation or inversion are highly dependent on the 'fill-in' created. This can be reduced by judicious re-ordering of equations. It is shown that use of newer ordering strategies, with corresponding computer code available in the public domain, can reduce the time required for ordering and computational requirements of analyses dramatically.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Association for the Advancement of Animal Breeding and Genetics |
| Editors | AAABG: Association for the Advancement of Animal Breeding, Genetics |
| Place of Publication | Collingwood, Australia |
| Pages | 282-285 |
| Volume | 16 |
| Publication status | Published - 2005 |
| Event | AAABG 2005: 16th Conference of the Association for the Advancement of Animal Breeding and Genetics - Noosa Lakes, Australia Duration: 25 Sept 2005 → 28 Sept 2005 |
Conference
| Conference | AAABG 2005: 16th Conference of the Association for the Advancement of Animal Breeding and Genetics |
|---|---|
| City | Noosa Lakes, Australia |
| Period | 25/09/05 → 28/09/05 |
Keywords
- Animal Breeding
Fingerprint
Dive into the research topics of 'Ordering strategies to reduce computational requirements in variance component estimation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver