A simplified Newton iteration scheme for computation of factor loadings in maximum likelihood factor analysis is described. It operatee in the space of factor loadings and avoids eigenvalue problems. From this, a oomparatively small computational effort resulte. Besides of the cane of positive uniqu
โฆ LIBER โฆ
A Newton-Raphson algorithm for maximum likelihood factor analysis
โ Scribed by Robert I. Jennrich; Stephen M. Robinson
- Book ID
- 112725772
- Publisher
- Springer
- Year
- 1969
- Tongue
- English
- Weight
- 619 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0033-3123
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A Simplified Newton Method for Computing
โ
Prof. Dr. Joachim Focke
๐
Article
๐
1986
๐
John Wiley and Sons
๐
English
โ 507 KB
A hybrid EM/Gauss-Newton algorithm for m
โ
Murray Aitkin; Irit Aitkin
๐
Article
๐
1996
๐
Springer US
๐
English
โ 344 KB
A faster alternative to the EM algorithm in finite mixture distributions is described, which alternates EM iterations with Gauss Newton iterations using the observed information matrix. At the expense of modest additional analytical effort in obtaining the observed information, the hybrid algorithm
A Newton-Raphson method for moving-avera
โ
Demeure, C.J.; Mullis, C.T.
๐
Article
๐
1990
๐
IEEE
โ 988 KB
A reliability coefficient for maximum li
โ
Ledyard R Tucker; Charles Lewis
๐
Article
๐
1973
๐
Springer
๐
English
โ 698 KB
Optimal value for the Newton-Raphson div
โ
A. Parker; J.O. Hamblen
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 298 KB
A gauss-newton algorithm for exploratory
โ
Robert I. Jennrich
๐
Article
๐
1986
๐
Springer
๐
English
โ 458 KB