Clay–Mahler lectures (3) in Melbourne
Name: | Clay–Mahler lectures (3) in Melbourne |
Calendar: | 1-day meetings & lectures |
When: | Mon, August 31, 2009, 10:00 am - Thu, September 3, 2009, 10:00 am |
Description: |
Lecture slides in PDF format (1.0 Mbyte)
Lecture slides in PDF format (0.7 Mbyte)
Abstract: Mathematical research and the internetProf. Tao will talk about some of his personal experiences on how the internet is transforming the way he and other mathematicians do research, from mundane tools as email, home pages and search engines, to blogs, pre–print servers, wikis, and more. Abstract: Compressed SensingSuppose one wants to recover an unknown signal \boldsymbol{x} in \mathbb{R}^n from a given vector A\boldsymbol{x}=\boldsymbol{b} in \mathbb{R}^m of linear measurements of the signal \boldsymbol{x}. If the number of measurements m is less than the degrees of freedom n of the signal, then the problem is underdetermined and the solution \boldsymbol{x} is not unique. However, if we also know that \boldsymbol{x} is sparse or compressible with respect to some basis, then it is a remarkable fact that (given some assumptions on the measurement matrix A) we can reconstruct \boldsymbol{x} from the measurements \boldsymbol{b} with high accuracy, and in some cases with perfect accuracy. Furthermore, the algorithm for performing the reconstruction is computationally feasible. This observation underlies the newly developing field of compressed sensing. In this talk we will discuss some of the mathematical foundations of this field. Abstract: Discrete Random MatricesThe spectral theory of continuous random matrix models (e.g., real or complex gaussian random matrices) has been well studied, and very precise information on the distribution of eigenvalues and singular values is now known. But many of the results rely quite heavily on the special algebraic properties of the matrix ensemble (e.g., the invariance properties with respect to the orthogonal or unitary group). As such, the results do not easily extend to discrete random matrix models, such as the Bernoulli model of matrices with random \pm1 signs as entries. Recently, however, tools from additive combinatorics and elementary linear algebra have been applied to establish several results for such discrete ensembles, such as the circular law for the distribution of eigenvalues, and also explicit asymptotic distributions for the least singular values of such matrices. We survey some of these developments in this talk. |
Location: | Access Grid Room, Monash University Map |
URL: | /tiki-read_article.php?articleId=61 |
Created: | 14 Jul 2009 09:26 pm UTC |
Modified: | 08 Sep 2009 12:47 am UTC |
By: | rmoore |
Status: | Confirmed |