A Hadamard-type lower bound for symmetric diagonally dominant positive matrices
نویسندگان
چکیده
Article history: Received 8 April 2014 Accepted 8 January 2015 Available online xxxx Submitted by B. Lemmens MSC: 15B48 15A15 15A45
منابع مشابه
Inverses of symmetric, diagonally dominant positive matrices and applications
We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . 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 r...
متن کاملThe Class of Inverse M-Matrices Associated to Random Walks
THE CLASS OF INVERSE M-MATRICES ASSOCIATED TO RANDOM WALKS∗ CLAUDE DELLACHERIE† , SERVET MARTINEZ‡ , AND JAIME SAN MARTIN‡ Abstract. Given W = M−1, with M a tridiagonal M -matrix, we show that there are two diagonal matrices D,E and two nonsingular ultrametric matrices U, V such that DWE is the Hadamard product of U and V . If M is symmetric and row diagonally dominant, we can take D = E = I. W...
متن کاملTight bounds on the infinity norm of inverses of symmetric diagonally dominant positive matrices
We prove tight bounds for the ∞-norm of the inverse of symmetric diagonally dominant positive matrices. Applications include numerical stability for linear systems, bounds on inverses of differentiable functions, and the consistency of maximum entropy graph distributions from single samples.
متن کاملBounding the error in Gaussian elimination for tridiagonal systems
If is the computed solution to a tridiagonal system Ax b obtained by Gaussian elimination, what is the "best" bound available for the error x and how can it be computed efficiently? This question is answered using backward error analysis, perturbation theory, and properties of the LU factorization of A. For three practically important classes of tridiagonal matrix, those that are symmetric posi...
متن کاملOn Factor Width and Symmetric H-matrices
We define a matrix concept we call factor width. This gives a hierarchy of matrix classes for symmetric positive semidefinite matrices, or a set of nested cones. We prove that the set of symmetric matrices with factor width at most two is exactly the class of (possibly singular) symmetric H-matrices (also known as generalized diagonally dominant matrices) with positive diagonals, H+. We prove b...
متن کامل