Keywords: Google problem Power Method Stochastic matrices Global rate of convergence Gradient methods Strong convexity a b s t r a c t In this paper, we develop new methods for approximating dominant eigenvector of column-stochastic matrices. We analyze the Google matrix, and present an averaging scheme with linear rate of convergence in terms of 1-norm distance. For extending this convergence ...

In this paper we will examine self-accelerating in terms of convergence speed and the corresponding index of efficiency in the sense of Ostrowski–Traub of certain standard and most commonly used in practice multipoint iterative methods using several initial approximations for numerical solution of nonlinear equations due to optimal in the sense of the Kung–Traub algorithm of order 4, 8 and 16. ...

We present results on the Swendsen-Wang for the Ising ferromagnet in the low temperature case without external eld in the thermodynamic limit. We discuss in particular the rate of convergence to the equilibrium Gibbs state in nite and innnite volume, the absence of ergodicity in the innnite volume and the long time behaviour of the probability distribution of the dynamics for various starting c...

The proper assessment of interaxial distance and convergence control are important factors in stereoscopic imaging technology to make an efficient 3D image. To control interaxial distance and convergence for efficient 3D shooting, horizontal 3D camera rig is designed using some hardware components like ‘LM Guide’, ‘Goniometer’ and ‘Rotation Stage’. The horizontal 3D camera rig system can be pro...

In this article we study approaches that can be used to minimise the convergence time, we also make a focus on microloops phenomenon, analysis and means to mitigate them. The convergence time reflects the time required by a network to react to a failure of a link or a router failure itself. When all nodes (routers) have updated their respective routing and forwarding databases, we can say the n...

4.1 Remarks. Suppose that the hypothesis of a theorem involves convergence (a). I t may happen (and does indeed in the case of all theorems in [S]) that convergence (cri) may be substituted in the hypothesis as follows: each ovregion which occurs in the proof is a (Tn-region for some n\ if there is a largest such n call it N. Then convergence (aN) may be substituted in the hypothesis and may, b...