A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
From MaRDI portal
Publication:3257784
DOI10.1002/sapm1959381104zbMath0087.01701OpenAlexW2333474041WikidataQ97008080 ScholiaQ97008080MaRDI QIDQ3257784
Publication date: 1959
Published in: Journal of Mathematics and Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sapm1959381104
Related Items (22)
Nested \(\epsilon\)-decompositions and clustering of complex systems ⋮ Reachability matrix by partitioning and related Boolean results ⋮ Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal ⋮ On some topological properties of the systems of compartments ⋮ Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods ⋮ A graph theoretic approach to matrix inversion by partitioning ⋮ Application of graphs to the Gaussian elimination method ⋮ Structural aspects of controllability and observability. II: Digraph decomposition ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Graph theoretic models ⋮ A graph theoretic approach to multivariable control system design ⋮ Reachability matrix and relation to large-scale systems ⋮ A simple equation solver and its application to financial modelling ⋮ Perfect graphs and complex surface singularities with perfect local fundamental group ⋮ Random matrices and graphs ⋮ Some structural theorems for partial difference operators ⋮ Bigraphs versus digraphs via matrices ⋮ Structurally fixed modes: Decomposition and reachability ⋮ An application of graph theory to a computer storage problem in residual analysis ⋮ The structural aspects of pole assignment ⋮ Autocatalytic Networks: An Intimate Relation between Network Topology and Dynamics ⋮ The square of a chordal graph
This page was built for publication: A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
