Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Instance Optimal Iterative Methods for Matrix Function Approximation

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 32-minute lecture on instance-optimal iterative methods for matrix function approximation, delivered by Cameron Musco from the University of Massachusetts Amherst at the Simons Institute. Delve into the conjugate gradient (CG) method's application in solving positive definite linear systems, examining its convergence rates and instance-optimality bounds. Investigate the Lanczos method's extension to approximating arbitrary matrix functions, including matrix square roots and exponentials. Analyze recent progress in proving instance-optimality for rational matrix functions and other key function classes. Consider open questions in the field and potential faster methods through alternative approaches like stochastic gradient methods. Gain insights from joint work with Noah Amsel, Tyler Chen, Anne Greenbaum, and Christopher Musco in this optimization and algorithm design-focused talk.

Syllabus

Instance Optimal Iterative Methods for Matrix Function Approximation

Taught by

Simons Institute

Reviews

Start your review of Instance Optimal Iterative Methods for Matrix Function Approximation

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.