Mathematics Graduate Student Colloquium

MGSC Website: http://math.uci.edu/~mgsc/

Random Butterfly Matrices

John Peca-Medlin
Friday, October 19, 2018
1:00 pm - 1:50 pm
RH 340P

Talk Abstract:

Random Butterfly Matrices are a recursively defined ensemble of random orthogonal matrices, first introduced by D. Stott Parker in 1995. The recurrent structure significantly decreases the complexity of typical matrix operators using these matrices. For instance, matrix-vector multiplication can be carried out in O(Nlog 2 N) operations rather than the typical O(N 2 ). Random Butterfly matrices can also be used to remove pivoting in Gaussian elimination. I will highlight some spectral and numerical properties of these matrices, along with performance comparisons to other random transformations.

About the Speaker:

I am a 4th year focusing on Random Matrix Theory (in Probability). My advisors are Tom Trogdon and Mike Cranston. (What else do you want? My favorite movie is Blade Runner. My favorite color is "Carolina Blue". )

Refreshments:

Pizza will be served after the talk.