YoVDO

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

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Computational Models Courses Algorithm Design Courses Diagonalization Courses Computational Mathematics Courses Matrix Multiplication Courses

Course Description

Overview

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.

Syllabus

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


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Introducción a la informática: codificación de la información
Universitat Jaume I via Independent
Introducción al desarrollo de videojuegos con Unity3D
Universitat Jaume I via Independent
Numerical Analysis
Vidyasagar University via Swayam
Computational Mathematics with SageMath
Institute of Chemical Technology (ICT) via Swayam
Computational Commutative Algebra
NPTEL via YouTube