Matrix Power, Determinant and Polynomials
Abstract
Commonly used approaches to calculating large matrix powers require the eigenvalues of matrices, and often eigenvalue computation can become a demanding and tedious work [3]. Abu-Saris and Ahmad provided in their paper [1] an approach that makes use of polynomials to calculate large powers of matrices. Their approach does not require eigenvalue calculation. The approach begins with the characteristic polynomial of square matrices, and continues with the use of the division algorithm along with the application of Cayley-Hamilton Theorem [2, p.210]. This approach produces a recursive algorithm for the computation of the coefficients of polynomials [1].
Keywords
Matrix Theory; Division Algorithm; Ring of Polynomials; Matrix Power; Determinants.
Full Text:
PDFReferences
R. Abu-Saris and W. Ahmad, Avoiding Eigenvalues in Computing Matrix Power, The American Mathematical Monthly , Vol. 112, Number 5, (May 2005) 450-454.
T. M. Apostol, Linear Algebra: A first Course with applications to Differential Equations, Wiley, New York, 1997.
S.N. Elaydi and W. A. Harris, Jr., on the computation of An, SIAM Rev. 40 (1998) 965-971.
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright © 2016 Journal of Progressive Research in Mathematics. All rights reserved.
ISSN: 2395-0218.
For any help/support contact us at editorial@scitecresearch.com, jprmeditor@scitecresearch.com.