Pure Math colloquium

Monday, March 4, 2013 4:00 pm - 4:00 pm EST (GMT -05:00)

Harm Derksen, University of Michigan

“Tensor Rank”

The notion of the rank of a matrix can be generalized to the rank of higher order tensors. This notion has many theoretical and practical applications. For example, the complexity of multiplying matrices is closely related to the rank of certain tensors. In signal processing, one would like to approximate tensors with tensors of low rank. Unfortunately, the rank of higher order tensors is more complicated than the rank of a matrix, and in many instances, the rank of a given tensor is hard to determine.

Refreshments will be served in MC 5046 at 3:30 p.m. Everyone is welcome to attend.