Semidefinite geometry of the numerical range

Details Semidefinite geometry of the numerical range Semidefinite geometry of the numerical range

2010-03-25

arxiv.org/abs/1003.4837v1

Mathematics

Optimization and Control

Scientific paper

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI), an affine section of the semidefinite cone, is always dual to the numerical range of a matrix, which is therefore an affine projection of the semidefinite cone. Both primal and dual sets can also be viewed as convex hulls of explicit algebraic plane curve components. Several numerical examples illustrate this interplay between algebra, geometry and semidefinite programming duality. Finally, these techniques are used to revisit a theorem in statistics on the independence of quadratic forms in a normally distributed vector.

Affiliated with

Also associated with

No associations

Rating

Semidefinite geometry of the numerical range 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 Semidefinite geometry of the numerical range, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semidefinite geometry of the numerical range will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556124