ABSTRACT

Solving for eigenvalues and eigenvectors in numerical computations and applications is one which can be done using numerous method. Arguably, method for solving of eigenvectors/values is one of the highest in numerical computation.

The Faddeev leverrier method is one of such methods for solving of eigenvalues and vectors making use of the race matrix and finding the coefficients of the characteristic polynomial in getting the eigenvalues. While solving using the Faddeev leverrier scheme, the inverse matrix A^-1 is obtained at no extra computational expense.