Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T06:28:17.575Z Has data issue: false hasContentIssue false

Computational Aspects of the Greatest Lower Bound to the Reliability and Constrained Minimum Trace Factor Analysis

Published online by Cambridge University Press:  01 January 2025

Jos M. F. ten Berge*
Affiliation:
University of Groningen
Tom A. B. Snijders
Affiliation:
University of Groningen
Frits E. Zegers
Affiliation:
University of Groningen
*
Requests for reprints should be sent to Jos M. F. ten Berge, Subfaculteit voor de Psychologie der Rijksuniversiteit, Oude Boteringestraat 34, 9712 GK Groningen. THE NETHERLANDS.

Abstract

In the last decade several algorithms for computing the greatest lower bound to reliability or the constrained minimum-trace communality solution in factor analysis have been developed. In this paper convergence properties of these methods are examined. Instead of using Lagrange multipliers a new theorem is applied that gives a sufficient condition for a symmetric matrix to be Gramian. Whereas computational pitfalls for two methods suggested by Woodhouse and Jackson can be constructed it is shown that a slightly modified version of one method suggested by Bentler and Woodward can safely be applied to any set of data. A uniqueness proof for the solution desired is offered.

Information

Type
Original Paper
Copyright
Copyright © 1981 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable