Pseudospectral Shattering the Sign Function and Diagonalization in Nearly Matrix Multiplication Time

YouTube·IEEE FOCS: Foundations of Computer Science

Explore a 20-minute IEEE conference talk delving into pseudospectral shattering, sign function diagonalization, and matrix multiplication optimization. Learn about the computational model, related work, and black box subroutines. Understand the challenges of the problem and discover the "Split and Deflate" algorithm by Beavers Jr. and Denman. Examine Robert's Iteration and the Circles of Appolonius as key concepts in this advanced mathematical discussion presented by researchers from UC Berkeley.