.tucker_congruence

Compute the Tucker congruence matrix between the columns of two loading
matrices.

Provides functions to perform exploratory factor analysis (EFA) procedures and compare their solutions. The goal is to provide state-of-the-art factor retention methods and a high degree of flexibility in the EFA procedures. This way, for example, implementations from R 'psych' and 'SPSS' can be compared. Moreover, functions for Schmid-Leiman transformation and the computation of omegas are provided. To speed up the analyses, some of the iterative procedures, like principal axis factoring (PAF), are implemented in C++.

Markus Steiner

EFAtools

Fast and Flexible Implementations of Exploratory Factor Analysis
Tools

.tucker_congruence function

<dl><dt>L1</dt>
<dd>Numeric matrix.</dd>
<dt>L2</dt>
<dd>Numeric matrix with the same dimensions as `L1`.</dd></dl>

Arguments

Tucker congruence between factors — .tucker_congruence

<dl>

<dt>L1</dt>
<dd>Numeric matrix.</dd>


<dt>L2</dt>
<dd>Numeric matrix with the same dimensions as `L1`.</dd>

</dl>

.tucker_congruence: Tucker congruence between factors

Description

Usage

Value

Arguments

References