structured matrices

Wednesday, January 27, 2016 - 10:15am - 11:05am
Lek-Heng Lim (University of Chicago)
We show that in many instances, at the heart of a problem in numerical computation sits a special 3-tensor, the structure tensor of the problem that uniquely determines its underlying algebraic structure. Any decomposition of the structure tensor into rank-1 terms gives an explicit algorithm for solving the problem. The rank of the structure tensor measures the speed of the fastest possible algorithm for the problem, whereas the nuclear and spectral norms quantify the numerical stability of the stablest algorithm for the problem.
Subscribe to RSS - structured matrices