A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices

Details A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices

2005-05-31

arxiv.org/abs/math/0505680v1

Lin. Alg. Appl. 413, 155-176 (2006).

Mathematics

Functional Analysis

24 pages

Scientific paper

Let $A$ be a positive semidefinite matrix, block partitioned as $$ A=\twomat{B}{C}{C^*}{D}, $$ where $B$ and $D$ are square blocks. We prove the following inequalities for the Schatten $q$-norm $||.||_q$, which are sharp when the blocks are of size at least $2\times2$: $$ ||A||_q^q \le (2^q-2) ||C||_q^q + ||B||_q^q+||D||_q^q, \quad 1\le q\le 2, $$ and $$ ||A||_q^q \ge (2^q-2) ||C||_q^q + ||B||_q^q+||D||_q^q, \quad 2\le q. $$ These bounds can be extended to symmetric partitionings into larger numbers of blocks, at the expense of no longer being sharp: $$ ||A||_q^q \le \sum_{i} ||A_{ii}||_q^q + (2^q-2) \sum_{i

Affiliated with

Also associated with

No associations

Rating

A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455729