No label defined (Q3687601)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3911583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3911583 |
Statements
1982
0 references
linear model
0 references
normal equations
0 references
conjugate gradient algorithms
0 references
experimental designs
0 references
full rank parametrization
0 references
0.7973536252975464
0 references
0.7633687853813171
0 references
[For the entire collection see Zbl 0566.00022.] Because of their low storage requirements, conjugate gradient algorithms have proved useful in the solution of large and/or sparse linear systems. This paper discusses the application of conjugate gradient algorithms to the models associated with a number of common experimental designs. Under some assumptions about balance, the number of iterations necessary to fit any hierarchical or partial-hierarchical model is less than or equal to the number of terms in the model. The problem of finding an adequate full rank parametrization will also be considered.
0 references