We propose a new method for accelerating the convergence of the implicitly restarted Arnoldi (IRA) algorithm for the solution of large sparse nonsymmetric eigenvalue problems. A new relationship between the residual of the current step and the residual in the previous step is derived and we use...

In this paper a second degree iterative Monte Carlo method for solving systems of linear algebraic equations and matrix inversion is presented. Comparisons are made with iterative Monte Carlo methods with degree one. It is shown that the mean value of the number of chains N, and the chain length...