A linear symbolic-based approach to matrix inversion

Hossein Arsham (harsham@ubalt.edu), Darush Davani and Jae B. Yu

Mathematics and Computers in Simulation (MATCOM), 1993, vol. 35, issue 6, 493-500

Abstract: For inverting a given matrix An×n with numerical and/or symbolic entries the Gaussian Row Operations (GRO) method has been widely applied. One problem with this approach is that the necessary GRO must be performed on an augmented matrix of order n×2n. We present a new method using the standard GRO with considerable reduction in the number of columns. The augmented matrix in the proposed method is of order n×(n+1), where the elements of the last column are all symbolic. Implementation issues for packaging this representation with existing symbolic computation systems are discussed. Computational experience using randomly generated matrices is reported, showing the superiority of this new approach over the conventional technique, namely in terms of both execution time and memory requirement.

Date: 1993
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475493900675
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:35:y:1993:i:6:p:493-500

DOI: 10.1016/0378-4754(93)90067-5

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu (repec@elsevier.com).