This paper describes several numerical methods for matrix inversion. The computational steps and the relative merits of the methods are discussed. A section is also particularly devoted to the inversion of complex matrices on mini-computers.
Get full access to this article
View all access options for this article.
References
1.
RalstonA., A first course in Numerical Analysis, McGraw-Hill (1965).
2.
HildebrandF. B., Introduction to Numerical Analysis, McGraw-Hill (1956).
3.
HammingR. E., Numerical Methods for Scientists and Engineers, McGraw-Hill.
4.
ShipleyR. B.ColemanD., ‘A new direct matrix inversion method’Trans. A.I.E.E., pp. 568–571 (Nov. 1959).
5.
TinneyW. F.WalkerJ. W., ‘Direct solutions of sparse network equations by optimal ordered triangular factorization’Proc. I.E.E.E., 55, No. 11, pp. 1801–1809 (Nov. 1967).
6.
SatoN.TinneyW. F., ‘Techniques for exploiting the sparsity of the network admittance matrix’, I.E.E.E. Trans. Power Apparatus and System, 82, pp. 944–950 (1963).
7.
StottB.HobsonE., ‘Solution of large power system networks by ordered elimination. A comparison of ordering schemes’. Proc. I.E.E.E., 118, No. 1, pp. 125–134 (Jan. 1971).
8.
ZollenbopfK., Bi-factorization, Basic Computational Algorithm and Programming Techniques, in Large Sparse Sets of Linear Equations, Academic Press, pp. 75–86 (1971).
