Abstract
Let and be the sets of positive semidefinite and positive definite matrices of order , respectively, with nonnegative entries, where some positions of zero entries are restricted by a simple graph with vertices. It is proved that for a connected simple graph of order , the set of powers preserving positive semidefiniteness on is precisely the same as the set of powers preserving positive definiteness on . In particular, this provides an explicit combinatorial description of the critical exponent for positive definiteness, for all chordal graphs. Using chain sequences, it is proved that the Hadamard powers preserving the positive (semi) definiteness of every tridiagonal matrix with nonnegative entries are precisely . The infinite divisibility of tridiagonal matrices is studied. The same results are proved for a special family of pentadiagonal matrices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.