A New Recursive Algorithm For Inverting A General Comrade Matrix

TL;DR

This paper introduces a reliable recursive algorithm for inverting general comrade matrices using parallel computing, with implementation options in CAS software and demonstrated through illustrative examples.

Contribution

It presents a novel recursive and parallelizable algorithm for inverting comrade matrices with a computational cost of O(n^2).

Findings

Algorithm successfully invert general comrade matrices.

Implementation demonstrated in MAPLE, MATLAB, and MATHEMATICA.

Algorithm is efficient and reliable for symbolic computation.

Abstract

In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our 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.