A graph theoretic approach to matrix inversion by partitioning
From MaRDI portal
Publication:1130837
DOI10.1007/BF01386304zbMath0109.09003OpenAlexW2087905200MaRDI QIDQ1130837
Publication date: 1962
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131523
Related Items
The Moore-Penrose inverse of matrices with an acyclic bipartite graph, Reachability matrix by partitioning and related Boolean results, THEORY AND ALGORITHMS ON PERIOD ASSIGNMENT OF DISCRETE-EVENT DYNAMIC SYSTEMS, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Structural aspects of controllability and observability. II: Digraph decomposition, Graph theoretic models, A Graph Technique for Inverting Certain Matrices, Unnamed Item, On the ultimate behaviour of the sequence of consecutive powers of a matrix in the max-plus algebra, Some Results on Sparse Matrices, Partitioning, tearing and modification of sparse linear systems, Optimum tearing in large scale systems and minimum feedback cutsets of a digraph, Random matrices and graphs, On the Inversion of Sparse Matrices, On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices, On the Gaussian elimination method for inverting sparse matrices, Über die Ordnungen von Wohlfahrt. II, Application of net subgroups to the theory of sparse matrices, Finding the inverse and connections of a type of large sparse matrix
Cites Work
- A Survey of Some Closed Methods for Inverting Matrices
- A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
- On the Consistency of Precedence Matrices
- A Comment on Matrix Inversion by Partition
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Solving linear algebraic equations can be interesting
