An Efficient and Simple Algorithm for Matrix Inversion

An Efficient and Simple Algorithm for Matrix Inversion

Ahmad Farooq, Khan Hamid
Copyright: © 2010 |Pages: 8
DOI: 10.4018/jtd.2010010102
(Individual Articles)
No Current Special Offers


In this paper, a new algorithm is proposed for finding inverse and determinant of a given matrix in one instance. The algorithm is straightforward in understanding and manual calculations. Computer implementation of the algorithm is extremely simple and is quite efficient in time and memory utilization. The algorithm is supported by an example. The number of multiplication/division performed by the algorithm is exactly; however, its efficiency lies in the simplicity of coding and minimal utilization of memory. Simple applicability and reduced execution time of the method is validated form the numerical experiments performed on test problems. The algorithm is applicable in the cases of pseudo inverses for non-square matrices and solution of system of linear equations with minor modification.
Article Preview

(A). Simple Algorithm For Matrix Inversion

The algorithm assumes to take a square matrix jtd.2010010102.m03of dimension n. The inverse is calculated in n iterations. In each iteration p, all the existing elements jtd.2010010102.m04of A change to new values jtd.2010010102.m05After the last iteration i.e. when jtd.2010010102.m06, jtd.2010010102.m07will be the elements of the inverse. The determinant of the matrix (denoted by d) is also calculated iteratively through successive multiplication of the pivot selected in each iteration. In this algorithm the pivots are selected diagonally starting from jtd.2010010102.m08to jtd.2010010102.m09If any pivot is found to be zero i.e., jtd.2010010102.m10then inverse cannot be calculated. If an inverse is calculated then d will contain the determinant of A.

Complete Article List

Search this Journal:
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing