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

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

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

The Algorithm: Split and Deflate (Beavers Jr. and Denman, °74)

6 of 7

6 of 7

The Algorithm: Split and Deflate (Beavers Jr. and Denman, °74)

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

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

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Setting and Results
  3. 3 Model of Computation and Related Work
  4. 4 Black Box Subroutines
  5. 5 What Makes this Problem Hard?
  6. 6 The Algorithm: Split and Deflate (Beavers Jr. and Denman, °74)
  7. 7 Robert's Iteration and the Circles of Appolonius

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.