Positive Semidefinite Pattern Decompositions
Daniel Hershkowitz
Abstract
Daniel Hershkowitz
Abstract
It is shown that every positive semidefinite matrix in a block tridiagonal form with square diagonal blocks can be written as a sum of positive semidefinite matrices with complementary off diagonal block patterns. A similar result holds for completely positive matrices and, under a certain condition, for doubly nonnegative matrices.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is shown that every positive semidefinite matrix in a block tridiagonal form with square diagonal blocks can be written as a sum of positive semidefinite matrices with complementary off diagonal block patterns. A similar result holds for completely positive matrices and, under a certain condition, for doubly nonnegative matrices.
Key concepts: Tridiagonal matrix, Mathematics, Positive-definite matrix, Diagonal, Block matrix, Semidefinite programming, Combinatorics, Block (permutation group theory)