Hostname: page-component-77c78cf97d-hf2s2 Total loading time: 0 Render date: 2026-04-24T16:05:08.092Z Has data issue: false hasContentIssue false

A Gauss-Newton Algorithm for Exploratory Factor Analysis

Published online by Cambridge University Press:  01 January 2025

Robert I. Jennrich*
Affiliation:
University of California, Los Angeles
*
Requests for reprints should be sent to Robert I. Jennrich, Department of Mathematics, University of California, Los Angeles, CA 90024.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is shown that the scoring algorithm for maximum likelihood estimation in exploratory factor analysis can be developed in a way that is many times more efficient than a direct development based on information matrices and score vectors. The algorithm offers a simple alternative to current algorithms and when used in one-step mode provides the simplest and fastest method presently available for moving from consistent to efficient estimates. Perhaps of greater importance is its potential for extension to the confirmatory model. The algorithm is developed as a Gauss-Newton algorithm to facilitate its application to generalized least squares and to maximum likelihood estimation.

Information

Type
Original Paper
Copyright
Copyright © 1986 The Psychometric Society