Revealing the Hidden Mathematical Beauties of the Cayley-Hamilton Method

Abstract

The inversion of a non-singular square matrix applying a Computer Algebra System (CAS) is straightforward. The CASs make the numeric computation efficient but mock the mathematical characteristics. The algorithms conducive to the output are sealed and inaccessible. In practice, other than the CPU timing, the applied inversion method is irrelevant. This research-oriented article discusses one such process, the Cayley-Hamilton (C.H.) [1] . Pursuing the process symbolically reveals its unpublished hidden mathematical characteristics even in the original article [1] . This article expands the general vision of the original named method without altering its practical applications. We have used the famous CAS Mathematica [2] . We have briefed the theory behind the method and applied it to different-sized symbolic and numeric matrices. The results are compared to the named CAS’s sealed, packaged library commands. The codes are given, and the algorithms are unsealed.