Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2007
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912655137046528 |
|---|---|
| author | Vershynin, Roman |
| author_facet | Vershynin, Roman |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0703093 |
| institution | arXiv |
| publishDate | 2007 |
| record_format | arxiv |
| spellingShingle | Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms Vershynin, Roman Computational Geometry Data Structures and Algorithms Numerical Analysis G.1.6; G.1.3 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. |
| title | Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms |
| topic | Computational Geometry Data Structures and Algorithms Numerical Analysis G.1.6; G.1.3 |
| url | https://arxiv.org/abs/cs/0703093 |