*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Sparse Solutions to Underdetermined Linear Systems
GUEST LECTURER
Joel A. Tropp
AFFILIATION
The University of Michigan
ABSTRACT
A fundamental problem in applied mathematics, statistics, and electrical engineering is to solve underdetermined systems of linear equations. Basic linear algebra seems to forbid this possibility. But a recent strand of research has established that certain underdetermined systems can be solved robustly with efficient algorithms, provided that the solution is sparse (i.e., has many zero components). This talk provides an overview of these sparse representation problems, and it describes the basic algorithmic approaches. Then it details situations where the algorithms are guaranteed to succeed. In particular, the talk introduces some new work on the case where the matrix is deterministic and the sparsity pattern is random. It also covers some results for the case where the matrix is random, which is the situation in Compressed Sensing applications.
