Pages that link to "Item:Q1130837"

The following pages link to A graph theoretic approach to matrix inversion by partitioning (Q1130837):

Displaying 19 items.

• Über die Ordnungen von Wohlfahrt. II (Q1055561) (← links)
• Application of net subgroups to the theory of sparse matrices (Q1058263) (← links)
• Reachability matrix by partitioning and related Boolean results (Q1118616) (← links)
• Structural aspects of controllability and observability. II: Digraph decomposition (Q1142739) (← links)
• Graph theoretic models (Q1148340) (← links)
• Partitioning, tearing and modification of sparse linear systems (Q1212513) (← links)
• Optimum tearing in large scale systems and minimum feedback cutsets of a digraph (Q1257860) (← links)
• The Moore-Penrose inverse of matrices with an acyclic bipartite graph (Q1886523) (← links)
• On the ultimate behaviour of the sequence of consecutive powers of a matrix in the max-plus algebra (Q1973921) (← links)
• Random matrices and graphs (Q2522339) (← links)
• On the Gaussian elimination method for inverting sparse matrices (Q2551673) (← links)
• Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations (Q3761563) (← links)
• THEORY AND ALGORITHMS ON PERIOD ASSIGNMENT OF DISCRETE-EVENT DYNAMIC SYSTEMS (Q4012682) (← links)
• On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices (Q4053004) (← links)
• Finding the inverse and connections of a type of large sparse matrix (Q5543008) (← links)
• (Q5557406) (← links)
• A Graph Technique for Inverting Certain Matrices (Q5610045) (← links)
• Some Results on Sparse Matrices (Q5641963) (← links)
• On the Inversion of Sparse Matrices (Q5723446) (← links)