Abstract
A technique is given for permuting the rows and columns of a general square matrixM into a fully reduced matrixC. The corresponding algorithm is described, its validity is proved and it is compared with Harary's algorithm [5].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Edmonds,Paths, trees and flowers, Canad. J. Math. 17 (1965).
M. Fiedler,On inverting partitioned matrices, Czech. Math. J. (88) 13 (1963).
M. Fiedler,Some applications of graphs, matrices and geometry, Czech. contr., Swedish-Czech. Sem. on Appl. Math., IVA, Stockholm May 1973.
F. Harary,A seminar on graph theory, Holt, Rinehart and Winston Inc. (1967).
F. Harary,Structural models, John Wiley and Sons, Inc. (1965).
P. Liebl und J. Sedláček,Umformung von Quadratmatrizen auf quasitrianguläre Form mit Mitteln der Graphtheorie, Apl. Math. Sv. 11,1 (1966) Praha.
M. Nováková,On the use of some properties of Leontief's matrices, Apl. Math. Sv. 15,2 (1970) Praha.
J. K. Reid,Large sparse sets of linear equations, Proc. of Oxford conf. of the Inst. of Math. and its Applications, April 1970. Academic Press, London and N.Y. (1971).
R. S. Varga,Matrix iterative analysis, Prentice Hall, Englewood Cliffs, N.J. (1962).
A. T. Berztiss,Modern Algorithms, Rapp. 1973. 17, Dept of Comp. Science of CTH.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Novak, M. Full reduction of a general square matrix. BIT 14, 58–62 (1974). https://doi.org/10.1007/BF01933118
Issue Date:
DOI: https://doi.org/10.1007/BF01933118