Pseudospectral Shattering the Sign Function and Diagonalization in Nearly Matrix Multiplication Time
Offered By: IEEE via YouTube
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
Dynamic Programming, Greedy AlgorithmsUniversity of Colorado Boulder via Coursera First Order Optical System Design
University of Colorado Boulder via Coursera CUDA Programming - High-Performance Computing with GPUs
freeCodeCamp Parallel and Concurrent Programming with Java 2
LinkedIn Learning Python Parallel and Concurrent Programming Part 2
LinkedIn Learning