We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to a simple preconditioning technique. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Convergence analysis shows that the algorithm is effective for a crude inner tolera...

The iteration of complex function can generate beautiful fractal images. This paper presents a novel method based on the iteration of the distance ratio with two points, which generates a generalized Mandelbrot set according to distance ratio convergence times. This paper states the definition of distance ratio and its iteration. Then taking the complex function f(z)=z+c for example, it discuss...

Correctness: The first step is to choose a useful loop invariant. Consider the following invariant: At the end of the k iteration of the outer for loop, the array A[1 · · k] is sorted and A[k] is the k smallest element in A. Let us focus on the first execution of the outer for loop. In this case, the inner for loop executes (n− 1) times. After the inner for loop has executed for the first time,...

We present an iterative method based on the Hermitian and skew-Hermitian splitting for solving the continuous Sylvester equation. By using the Hermitian and skew-Hermitian splitting of the coefficient matrices A and B, we establish a method which is practically inner/outer iterations, by employing a CGNR-like method as inner iteration to approximate each outer iterate, while each outer iteratio...

In this paper, exact closed-form solutions for displacement and stress components of thick-walled functionally graded (FG) spherical pressure vessels are presented. To this aim, linear variation of properties, as an important case of the known power-law function model is used to describe the FG material distribution in thickness direction. Unlike the pervious studies, the vessels can have arbit...

For the Hermitian inexact Rayleigh quotient iteration (RQI), we present general convergence results, independent of iterative solvers for inner linear systems. We prove that the method converges quadratically at least under a new condition, called the uniform positiveness condition. This condition can be much weaker than the commonly used one that at outer iteration k, requires the relative res...

Convergence results are provided for inexact inverse subspace iteration applied to the problem of finding the invariant subspace associated with a small number of eigenvalues of a large sparse matrix. These results are illustrated by the use of block-GMRES as the iterative solver. The costs of the inexact solves are measured by the number of inner iterations needed by the iterative solver at ea...

Newton's Method constitutes a nested iteration scheme with the Newton step as the outer iteration and a linear solver of the Jacobian system as the inner iteration. We examine the interaction between these two schemes and derive solution techniques for the linear system from the properties of the outer Newton iteration. Contrary to inexact Newton methods, our techniques do not rely on relaxed t...

We analyze the Chebyshev iteration in which the linear system involving the splitting matrix is solved inexactly by an inner iteration. We assume that the tolerance for the inner iteration may change from one outer iteration to the other. When the tolerance converges to zero, the asymptotic convergence rate is unaaected. Motivated by this result, we seek the sequence of tolerance values that yi...