A New Recursive Algorithm For Inverting A General Comrade Matrix

Abstract

In this paper, a reliable symbolic computational algorithm is presented for inverting a general companion matrix by using parallel computing along with recursion. The computational cost of the algorithm is $O(n^2)$. The algorithm is implementable to the Computer Algebra System (CAS) such as MAPLE, MATLAB, and MATHEMATICA. Three examples are presented for the sake of illustration.