We consider the computation of a few eigenvectors and corresponding eigen-values of a large sparse nonsymmetric matrix. In order to compute eigenvaluesin an isolated cluster around a given shift we apply shift-and-invert Arnoldi’smethod with and without implicit restarts. For the inner iterations we useGMRES as the iterative solver. The costs of the inexact solves are measured<l...

In this work, a new iterative method is proposed for obtaining the approximate solution of a class of Hammerstein type Integral Equations System. The main structure of this method is based on the Richardson iterative method for solving an algebraic linear system of equations. Some conditions for existence and unique solution of this type equations are imposed. Convergence analysis and error bou...

This pap that we have developed target tracking for placement in future M straightforward method by using a total station, prism targets mounted o to Rocky8 rover mast ca residual error. Camera solutions for mast pan image appears right at t issues were raised. Mas parallel to the masthead of the camera model in center of the image. Desp non-iterative closed-form with Matlab routines. A over 50...

This experiment was carried out on 123 Farahani ewes from a herd in Delijan city in Markazi province of Iran to determine the best short-term method for oestrus synchronization. Ewes were divided into five experimental groups randomly: group 1) use of controlled intervaginal drug release devices (CIDR) for 7 days with intramuscular (IM) injection of PGF2α on zero day and IM injection of 500 IU ...

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...