A Gauss-Newton algorithm for exploratory factor analysis (Q1081250)

From MaRDI portal
Revision as of 11:12, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Gauss-Newton algorithm for exploratory factor analysis
scientific article

    Statements

    A Gauss-Newton algorithm for exploratory factor analysis (English)
    0 references
    0 references
    1986
    0 references
    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.
    0 references
    one-step efficiency
    0 references
    Fisher scoring
    0 references
    fitting a covariance structure model
    0 references
    scoring algorithm
    0 references
    maximum likelihood estimation
    0 references
    exploratory factor analysis
    0 references
    confirmatory model
    0 references
    Gauss-Newton algorithm
    0 references
    generalized least squares
    0 references

    Identifiers