Resumen de Matrix methods for finding
A. Jain Nitin, Kurshal D. Murthy, . Hamsapriye
An iterative algorithm for finding , (m> 0, u< n), is developed which involves generating a sequence of approximations to using the concept of eigenvectors. The convergence of this method is then established by studying the eigenvalues and eigenvectors of a matrix An, directly related to the algorithm itself. The matrix Anis constructed using the eigenvalues and eigenvectors, applying the concepts of diagonalization. An algorithm for finding higher powers of Anis explained. Using these higher powers of An, a direct method is also derived. Two numerical examples explaining the methods are given.
