the convergence hypothesis maintains that an economy whose productivity lags behind other economies has a potential to grow faster. in other words, this economy can experience faster economic growth through absorbing, accepting, and using available technology experience. in this study, we have examined the relationship between tfp of industry sectors and regional convergence in iran's prov...

The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a linear version of the Helmholtz machine. But even for a factor analysis model, the general convergence is not proved theoretically. In this article, we describe the geometrical understanding of the W-S algorithm in co...

We examine the convergence properties of the 2-nucleon Effective Range Expansion as used in Effective Theories (ET-ERE’s) for 3-nucleon calculations. We accomplish this by accounting for the 2-body dynamics with a simple rank-1 separable 2-body potential where the finite range effects can be incorporated systematically in both the 2and 3-body problems. We make our initial comparisons in the sim...

This paper employs a dynamic framework to compare the effects of alternative government activities on convergence of industrialized economies to the technology frontier. The government’s Instruments include facilitating private investment and education policy. The latter enhances skills of heterogenous specialists and imply the decision on their respective shares. The analysis distinguishes bet...

In this paper, we consider solutions of Toeplitz systems A n u = b where the Toeplitz matrices A n are generated by nonnegative functions with zeros. Since the matrices A n are ill-conditioned, the convergence factor of classical iterative methods, such as the damped Jacobi method, will approach 1 as the size n of the matrices becomes large. Here we propose to solve the systems by the multigrid...

SUMMARY Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. ...