2012

Inverses of symmetric, diagonally dominant positive matrices and applications

Hillar, Christopher J., Lin, Shaowei, Wibisono, Andre

Understand

We prove tight bounds for the $\infty$-norm of the inverse of symmetric, diagonally dominant positive matrices.

We also prove a new lower-bound form of Hadamard's inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices.
Applications of our results include numerical stability for linear systems, bounds on inverses of differentiable functions, and consistency of the maximum likelihood equations for maximum entropy graph distributions.

J.M. Varah. A lower bound for the smallest singular value of a matrix
1975
Earlier work this paper cites.
R.S. Varga. On diagonal dominance arguments for bounding ‖ A − 1 ‖ ∞ \|A^{-1}\|_{\infty}
1976
Earlier work this paper cites.
R.A. Horn and C.R. Johnson. Matrix Analysis
1990
Earlier work this paper cites.
R.A. Horn and C.R. Johnson. Topics in Matrix Analysis
1991
Earlier work this paper cites.
J.W. Demmel, N.J. Higham, and R. Schreiber. Block LU factorization
1992
Earlier work this paper cites.
S. Lang. Real and Functional Analysis
1993
Earlier work this paper cites.

P.N. Shivakumar, J.J. Williams, Q. Ye, and C.A. Marinov. On two-sided bounds related to weakly diagonally dominant M M -matrices with application to digital circuit dynamics
1996
Cited alongside, same era.
J.R. Munkres. Topology (2nd Edition)
2000
Cited alongside, same era.
C.R. Johnson and C. Hillar. Eigenvalues of words in two positive definite letters
2002
Cited alongside, same era.
D.A. Spielman and S.H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
2004
Cited alongside, same era.
J.M. Steele. The Cauchy-Schwarz Master Class
2004
Cited alongside, same era.
D.A. Spielman and S.H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
Original
2006
Cited alongside, same era.
R. Sanyal, B. Sturmfels, C. Vinzant. The entropic discriminant
Cited in the paper.

W. Li. The infinity norm bound for the inverse of nonsingular diagonal dominant matrices
2008
Later among the works it cites.
D. Cvetković and S. Simić. Towards a spectral theory of graphs based on the signless Laplacian, III
2010
Later among the works it cites.
D.A. Spielman. Algorithms, graph theory, and linear equations in Laplacian matrices
2010
Later among the works it cites.
S. Chatterjee, P. Diaconis, A. Sly. Random graphs with a given degree sequence
2011
Later among the works it cites.
C. Hillar and A. Wibisono. Maximum entropy distributions on graphs
Original
2013
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…