ARTICLE
TITLE

Convergence rate in structural equation models – analysis of estimation methods and implications in the number of observations

SUMMARY

Structural Equation Modeling (SEM) is used to analyze the causal relationships between observable and unobservable variables. Among the assumptions considered, but not essential, for the application of the SEM are the presence of multivariate normality between the data, and the need for a large number of observations, in order to obtain the variances and covariances between the variables. It is not always possible to have access to a sufficiently large number of observations to enable the calculation of parameters, and the convergence of the iterative algorithm is one of the problems in obtaining the results. This work investigates the convergence of iterative algorithms, which minimize the variation of parameters, through a stipulated convergence rate, using the Maximum Likelihood (ML) and Generalized Least Squares (GLS) estimation methods on structural equation models using confirmatory factor analysis (CFA) and regression models. Convergences were evaluated in relation to the number of observations, in order to obtain a minimum quantity sufficient for a convergence rate above 50%. The calculations were performed in the statistical environment R® version 3.4.4, and the results obtained showed a convergence rate above 50% for models estimated by GLS, even with the data showing lack of multivariate normality, kurtosis and accentuated asymmetry. Thus, it was possible to define a minimum number of observations necessary for an adequate convergence of the iterative algorithms in obtaining the necessary parameters.

 Articles related

Péter L. Erdos, Ervin Gyori, Tama´s Róbert Mezei, István Miklós, Dániel Soltész    

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain converges to the uniform distribution, but generally the rate of convergence ... see more


Anjar Wanto, Ni Luh Wiwik Sri Rahayu Ginantra, Surya Hendraputra, Ika Okta Kirana, Abdi Rahim Damanik    

The traditional Back-propagation algorithm has several weaknesses, including long training times and significant iterations to achieve convergence. This study aims to optimize traditional Back-propagation using the cyclical rule method to cover these wea... see more


Bruno Benato Rutyna, Marcio Augusto Villela Pinto, Reverton Luis Antunes Neundorf, Marcio Alexandro Maciel Anunciação, Marcio André Martins (Author)    

In this work, we applied different extrapolation techniques in association with the multigrid method to discover which one is the most effective in reducing the iteration error and the processing time (CPU time), as well as in improving the convergence f... see more


Sasha Stark,Jennifer Reynolds,Jamie Wiebe    

Despite the convergence of the gambling and gaming worlds, the majority of studies of gambling behaviour are void of gaming behaviour and vice versa. Further, many studies examine specific age ranges rather than covering the entire span of adolescence an... see more


Vilmar Steffen, Edson Antonio da Silva (Author)    

An algorithm for the solution of the mathematical model featuring reactive distillation process in steady-state columns is analyzed. It has been presumed that each stage’s outlet streams in the model were in phase equilibrium conditions and that chemical... see more