in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

Inverse iteration is a standard technique for nding selected eigenvectors associated with eigenvalues which are known approximately. At each step the solution of a linear system of equations is required, which is usually done by factorizing the system matrix. When direct factorization is impractical, iterative methods can be applied for solving the linear systems. Several results about terminat...

SUMMARY Recently the GMRESR inner-outer iteration scheme for the solution of linear systems of equations has been proposed by Van der Vorst and Vuik. Similar methods have been proposed by Axelsson and Vassilevski 1] and Saad (FGMRES) 10]. The outer iteration is GCR, which minimizes the residual over a given set of direction vectors. The inner iteration is GMRES, which at each step computes a ne...

This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. (1992a). We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suces. On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bo...

We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice...

We present a nested splitting conjugate gradient iteration method for solving large sparse continuous Sylvester equation, in which both coefficient matrices are (non-Hermitian) positive semi-definite, and at least one of them is positive definite. This method is actually inner/outer iterations, which employs the Sylvester conjugate gradient method as inner iteration to approximate each outer it...

A two-stage (nested) iteration strategy, in which the outer iteration is analogous to a block Gauss-Seidel method and the inner iteration to a Jacobi method for each of these blocks, often are used in the numerical solution of discretized approximations to the neutron transport equation. This paper is concerned with the effect, within a continuous space model, of errors from finite termination ...

By making use of tools from convex analysis, we formulate an inexact NewtonLandweber iteration method for solving nonlinear inverse problems in Banach spaces. The method consists of two components: an outer Newton iteration and an inner scheme. The inner scheme provides increments by applying Landweber iteration with non-smooth uniformly convex penalty terms to local linearized equations. The o...