Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)

A comparative study of matrix inversion by recursive algorithms through single and double bordering

Authors
Bhavanam Rami Reddy 0, Ramabhadra Prof. I. Ramabhadra Sarma
Corresponding Author
Bhavanam Rami Reddy
0Nagarjuna University
Available Online October 2006.
DOI
https://doi.org/10.2991/jcis.2006.249How to use a DOI?
Keywords
centrosymmetric matrix, bordering, operational count, cholesky decomposition
Abstract
In this paper we have derived single and double bordering methods for computation of the inverse of a matrix. The performance of these methods is compared with some existing methods . We conclude the following: For a general nonsingular matrix, both single and double bordering methods are superior to the existing factorization method, while the double bordering method is superior compared to the single bordering method. For example, n=31 (odd), the factorization, single and double bordering methods respectively have the operational counts as 60109,57961,56806. For n=30 (even), the factorization, single and double bordering methods respectively have the operational counts as 54495,52230,51405. For a PDS matrix, double bordering method is much superior compared to the single bordering and Cholesky methods. For a large n, the operational counts for double bordering, single bordering, and Cholesky methods are respectively of orders and (approximately). For example, n=31 (odd), the operational counts for double bordering, single bordering and Cholesky method respectively are 29116,38781,50158. For n=31 (odd), the operational counts for double bordering, single bordering and Cholesky method respectively are 26370,35120,45475.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
9th Joint International Conference on Information Sciences (JCIS-06)
Part of series
Advances in Intelligent Systems Research
Publication Date
October 2006
ISBN
978-90-78677-01-7
ISSN
1951-6851
DOI
https://doi.org/10.2991/jcis.2006.249How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Bhavanam Rami Reddy
AU  - Ramabhadra Prof. I. Ramabhadra Sarma
PY  - 2006/10
DA  - 2006/10
TI  - A comparative study of matrix inversion by recursive algorithms through single and double bordering
BT  - 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 281
EP  - 285
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.249
DO  - https://doi.org/10.2991/jcis.2006.249
ID  - RamiReddy2006/10
ER  -