In scientific computing, most computational time is spent on solving system of Simultaneous Linear Equations (SLE) which can be represented in matrix notations as
where is a singular/non-singular matrix, and b is a given vector in. For practical engineering/ science applications, matrix A can be either sparse (for most cases), or dense (for some cases). For a non-sin- gular coefficient matrix A, direct methods (Cholesky factorization, algorithm, decomposition, etc) or iterative methods (Conjugate Gradient algorithm, Bi-Conjugate Stabilization, GMRES, etc.) are used to solve Equation (1.1). If the coefficient matrix is singular or rectangular, the above mentioned direct and iterative methods cannot be used to solve Equation (1.1) and thus generalized inverse is needed to solve the unknown solution vector x in Equation (1.1).
The generalized (or pseudo) inverse of a matrix is an extension of the ordinary/regular square (non-singular) matrix inverse, which can be applied to any matrix (such as singular, rectangular etc.). The generalized inverse has numerous important engineering and sciences applications. Over the past decades, generalized inverses of matrices and its applications have been investigated by many researchers -. Generalized inverse is also known as “Moore-Penrose inverse” or “g-inverse” or “pseudo-inverse” etc.
In this paper we introduce an efficient (in terms of computational time and computer memory requirement) generalized inverse formulation to solve SLE with full or deficient rank of the coefficient matrix. The coefficient matrix can be singular/non-singular, symmetric/unsymmetric, or square/rectangular. Due to popular MATLAB software, which is widely accepted by researchers and educators worldwide, the developed code from this work is written in MATLAB language.
The rest of this paper is organized as follows. In Section 2, we discuss background of generalized inverse. In Section 3, we give a description of the algorithm. This section also describes the efficient generalized inverse formulation (which uses modified Cholesky factorization). In Section 4, we present comparison of numerical performances of the proposed algorithm with other existing algorithms. Extensive set of coefficient matrices (including rectangular, square, symmetrical, non-symmetrical, singular, non-singular matrices) obtained from well-established/popular websites   were tested and the numerical performance in terms of timings, error norm were compared with other algorithms. Finally, conclusions are drawn in Section 5.
2. Singular Value Decomposition (SVD) and the Generalized Inverse
A general (square or rectangular) matrix can be decomposed as
Let A be a singular matrix of size and let k be the rank of the matrix. Based on Equation (2.1), one has
Note: Eigen-values of and Eigen-values of are the same. However, the Eigen-vectors of and Eigen-vectors of are “NOT” the same.
Then, the generalized inverse of is the matrix and is given as
and is the diagonal matrix, with.
3. Efficient Generalized Inverse Algorithms -  
Moore-Penrose inverse can be computed using Singular Value Decomposition (SVD), Least Squares Method, QR factorizations, Finite Recursive Algorithm  , etc. In this work, our numerical algorithms have been based on:
(a) The “special Cholesky factorization” (for symmetrical/singular coefficient matrix), and
(b) The generalized inverse of a product of 2 matrices  and can be described in the following paragraphs.
The Moore-Penrose inverse (or generalized inverse or pseudo inverse) of a matrix (not necessarily a square matrix) is the unique matrix which satisfies the following four conditions:
1. General condition:
2. Reflexive condition:
3. Normalized condition:
4. Reverse normalized condition:
Consider with a square coefficient matrix, and let the rank be less than the size of the matrix (if r is the rank of the matrix, then). Let the size of the known right-hand-side vector be. Consider a symmetric positive matrix with rank (here, the matrix plays the same role as matrix in Equation (1.1)), then based on the theorem presented in , there exists a unique such that:
In Equation (3.1), matrices have the dimensions, respectively.
M is the upper triangular (special) Cholesky factorized matrix and contains exactly zero rows. Removing the zero rows from M, one obtains a (upper, rectangular) matrix.
In this work, the upper triangular (special) Cholesky factorized matrix can be obtained by the regular/ standard Cholesky factorization, with the following modifications:
a) When the diagonal term of the current row is very close to zero, then factorization of this dependent row is skipped.
b) When the current row is factorized, all previous rows were used except those dependent row(s).
Consider the generalized inverse of a matrix product  
From Equation (3.3), if then
If and A is a matrix of rank r, then one obtains from Equation (3.3)
Let us consider regular inverse in Equation (3.5) in place of generalized inverse
Using Equation (3.4),
From Equations (3.1)-(3.2) and Equation (3.6) one obtains,
Thus, Equation (3.7) becomes
While MATLAB solution can be obtained by implying the generalized inverse [see Equation (3.9)] to be formed explicitly, our main idea is to solve SLE where is a known right-hand-side vector.
4. Numerical Performance of ODU Generalized Inverse Solver
Based on the detailed algorithms explained in Section 3, the numerical performance of our proposed procedures are evaluated in this section. The known RHS vector can be random vector, or can be chosen such a way that the unknown solution vector.
We also compared the performance of our algorithm with the efficient algorithm described in  and also with MATLAB built-in function  for computing the generalized inverse explicitly. We use MATLAB version 126.96.36.1994 (R2008a) on Intel Core 2 CPU, 2.13 GHZ, 2GB RAM, Windows XP Professional SP3 for numerical comparisons.
Table 1 and Table 2 records the times (in seconds) taken by our proposed algorithm, the algorithm mentioned in  and MATLAB built-in function . For our convenience, we represent our algorithm with, algorithm in  with and MATLAB built-in function with. In addition, we have also presented the error norm for all the test matrices.
Table 1. Computational times (in seconds) for symmetric rank-deficient test matrices with RHS Vector as linear combination of columns of coefficient matrix.
Table 2. Computational times (in seconds) for rectangular rank-deficient test matrices (Tall type: Rows >> Cols) with RHS Vector as linear combination of columns of coefficient matrix.
In this paper, various efficient algorithms for solving SLE with full rank, or rank deficient have been reviewed, proposed and tested. The developed numerical procedures can be applied to solve “general” SLE (in the form, where the coefficient matrix could be square/rectangular, symmetrical/unsymmetrical, non-singular/singular). The users have option to choose either a direct solver or an iterative solver inside the generalized inverse to solve for SLE. Numerical results have shown that the proposed algorithms are highly efficient as compared to existing algorithms  (including the popular MATLAB built-in function) .
The authors would like to acknowledge Gelareh Bakhtyar for her useful discussions.
 Hou, G. and Wang, Y. (2004) A Substructuring Technique for Design Modifications of Interface Conditions. Structural Dynamics & Materials Conference, Palm Springs, California, 19-22 April 2004. http://dx.doi.org/10.2514/6.2004-2010