Combinatorial characterization of the null spaces of symmetric H-matrices

Linear Algebra and Its Applications

Volumn 392, Issue 1-3, 2004, Pages 71-90

  Chen, Doron ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Combinatorial matrix theory; Factor width; Gain graphs; Matroids; Null space; Signed graphs; Singular linear systems

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; LAPLACE TRANSFORMS; LINEAR SYSTEMS; PROBLEM SOLVING;

FACTOR WIDTH; GAIN GRAPHS; NULL SPACES; SIGNED GRAPHS;

MATRIX ALGEBRA;

EID: 5444231904     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.05.016     Document Type: Article

References (26)

1. P. Arbenz, Z. Drmač, On positive semidefinite matrices with known null space, SIAM J. Matrix Anal. Appl. 24 (1) (2002) 132-149.
2. O. Axelsson, Iterative Solution Methods, Cambridge University Press, 1994.
3. A. Berman, R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, SIAM, 1994.
4. E.G. Boman, D. Chen, B. Hendrickson, S. Toledo, Maximum weight basis preconditioners, Numer. Linear Algebra Appl., in press (doi:10.1002/nla.343).
5. E.G. Boman, D. Chen, O. Parekh, S. Toledo, On factor width and symmetric H-matrices, submitted for publication.
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, 1990.
7. G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, 1996.
8. J.L. Gross, Voltage graphs, Discrete Math. 9 (1974) 239-246.
9. J.L. Gross, T.W. Tucker, Generating all graph coverings by permutation voltage assignments, Discrete Math. 18 (1977) 273-283.
10. J.W. Grossman, D.M. Kulkarni, I.E. Schochetman, Algebraic graph theory without orientation, Linear Algebra Appl. 212/213 (1994) 289-307.
11. J.W. Grossman, D.M. Kulkarni, I.E. Schochetman, On the minors of an incidence matrix and its Smith Normal Form, Linear Algebra Appl. 218 (1-3) (1995) 213-224.
12. S. Guattery, On the quality of spectral separators, SIAM J. Matrix Anal. Appl. 19 (3) (1998) 701-719.
13. F. Harary, On the notion of balance of a signed graph, Michigan Math. 2 (1953-1954) 143-146.
14. M. Hestenes, E. Stiefel, Methods of conjugate gradients for solving linear systems, Natl. Bureau Stand. J. Res. 49 (1952) 409-436.
15. N.J. Higham, The accuracy of floating point summation, SIAM J. Sci. Comput. 14 (4) (1993) 783-799.
16. N.J. Higham, Accuracy and Stability of Numerical Algorithms, SIAM, 1996.
17. T. Kohno, H. Niki, H. Sawami, Y.-M. Gao, An iterative test for H-matrix, J. Comput. Appl. Math. 115 (2000) 349-355.
18. B. Li, L. Li, M. Harada, H. Niki, M.J. Tsatsomeros, An iterative criterion for H-matrices, Linear Algebra Appl. 271 (1998) 179-190.
19. L. Li, On the iterative criterion for generalized diagonally dominant matrices, SIAM J. Matrix Anal. Appl. 24 (2002) 17-24.
20. C.C. Paige, M.A. Saunders, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975) 617-629.
21. C.C. Paige, M.A. Saunders, Algorithm 583. LSQR: Sparse linear equations and sparse least squares, ACM Trans. Math. Software 8 (1982) 195-209.
22. K. Rybnikov, T, Zaslavsky, Criteria for balance in abelian gain graphs with applications to geometry, submitted for publication.
23. Y. Saad, M.H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7 (1986) 856-869.
24. O. Sorkine, D. Cohen-Or, S. Toledo, High-pass quantization for mesh encoding, in: Proceedings of ACM/Eurographics Symposium on Geometry Processing, Aachen, Germany, 2003.
25. D.L. Spielman, S.-H. Teng, Spectral partitioning works: Planar graphs and finite element meshes, in: IEEE Symposium on Foundations of Computer Science, 1996, pp. 96-105.
26. T. Zaslavsky, Signed graphs, Discrete Appl. Math. 4 (1982) 47-74.