In this paper we propose a faster variation of one-sided Jacobi algorithm. We bring the idea
of Fast-Givens rotation and utilize it in Jacobi algorithm to generate a so-called Fast …

The paper puts forward a new direct algorithm for computing the inverse of a square matrix.
The algorithm adopts a skill to compute the inverse of a regular matrix via computing the …

Advent of Matrix Theory has greatly aided and simplified the analysis for variety of signal
processing algorithms. It has been proven that matrix notation is convenient for …

Multi-core and even multi-processor computers are increasingly common, even for home
use. This does not automatically bring better processing performance. When the machine is …

We present two parallel strategies to compute the inverse of a dense matrix, based on the so-
called Sherman-Morrison algorithm and demonstrate their efficiency in memory and runtime …

We contribute two parallel strategies to compute the exact and approximate inverse of a
dense matrix, based on the so-called inverse Sherman-Morrison algorithm and demonstrate …

We study the use of massively parallel architectures for computing a matrix inverse. Two
different algorithms are reviewed, the traditional approach based on Gaussian elimination …

This paper derives a set of new algorithms based on the exchange method for the
computation of matrix inverses including nonsingular, symmetric nonsingular, and …

Solving the matrix inversion is an open problem which is often related to scientific
computation. Moreover, matrix inverse also has wide applications in social networks …

In this paper we present two different variants of method for symmetric matrix inversion,
based on modified Gaussian elimination. Both methods avoid computation of square roots …