Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms

Details Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms

2007-03-19

arxiv.org/abs/cs/0703093v1

Computer Science

Computational Geometry

12 pages, no figures. Based on the talk at the 2006 conference on Banach Spaces and their applications in analysis

Scientific paper

The simplex method in Linear Programming motivates several problems of
asymptotic convex geometry. We discuss some conjectures and known results in
two related directions -- computing the size of projections of high dimensional
polytopes and estimating the norms of random matrices and their inverses.

Affiliated with

Also associated with

No associations

Rating

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms 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 Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123221