Combinatorial characterization of the null spaces of symmetric H-matrices
DOI10.1016/j.laa.2004.05.016zbMath1061.65028MaRDI QIDQ1887495
Publication date: 26 November 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.05.016
algorithms; rank; matroids; singular linear systems; null space; signed graphs; gain graphs; combinatorial matrix theory; factor width; symmetric \(H\)-matrices; symmetric diagonally dominant \(M\)-matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15B57: Hermitian, skew-Hermitian, and related matrices
05C20: Directed graphs (digraphs), tournaments
15A03: Vector spaces, linear dependence, rank, lineability
05C22: Signed and weighted graphs
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signed graphs
- Generating all graph coverings by permutation voltage assignments
- Algebraic graph theory without orientation
- An iterative criterion for \(H\)-matrices
- On the minors of an incidence matrix and Smith normal form
- Voltage graphs
- An iterative test for \(H\)-matrix
- On factor width and symmetric \(H\)-matrices
- Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
- On the notion of balance of a signed graph
- The Accuracy of Floating Point Summation
- Maximum‐weight‐basis preconditioners
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Iterative Solution Methods
- On the Quality of Spectral Separators
- On the Iterative Criterion for Generalized Diagonally Dominant Matrices
- On Positive Semidefinite Matrices with Known Null Space
- Methods of conjugate gradients for solving linear systems
