BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Applied Mathematics and Statistics - ECPv6.5.1.6//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Applied Mathematics and Statistics
X-ORIGINAL-URL:https://engineering.jhu.edu/ams
X-WR-CALDESC:Events for Department of Applied Mathematics and Statistics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240229T133000
DTEND;TZID=America/New_York:20240229T143000
DTSTAMP:20240715T082730
CREATED:20240122T140634Z
LAST-MODIFIED:20240313T145736Z
UID:47283-1709213400-1709217000@engineering.jhu.edu
SUMMARY:AMS Weekly Seminar | Assistant Professor Christopher Musco
DESCRIPTION:Location:Olin 305 \nWhen: February 29th at 1:30 p.m. \nTitle: The Lanczos method\, matrix functions\, and the quest for optimality \nAbstract: First introduced in 1950\, the Lanczos method is a backbone of numerical linear algebra\, underlying our fastest algorithms for solving linear systems\, computing eigenvectors\, and much more. It is easy to implement\, works well in finite precision\, and most importantly\, is remarkably fast. In fact\, the Lanczos method typically converges much faster than our best theoretical results are able to predict\, a convenient yet puzzling mystery that has endured for decades. In this talk\, I will discuss recent progress on better explaining the power of the Lanczos method for the important problem of computing matrix functions like the matrix exponential\, square root\, matrix log\, etc. In particular\, we prove that\, for a wide class of functions\, the Lanczos method performs near optimally among *all possible* Krylov subspace methods. Previously\, such a result was only known for the matrix inverse. In addition to our main result\, I will discuss a number of open problems\, including questions about numerical stability and connections to recent work on faster linear system solves for sparse matrices. \nBased on joint work with Noah Amsel\, Tyler Chen\, Anne Greenbaum\, and Cameron Musco. \nZoom link: https://wse.zoom.us/j/94601022340
URL:https://engineering.jhu.edu/ams/event/ams-weekly-seminar-assistant-professor-christopher-musco/
LOCATION:Olin 305
CATEGORIES:Seminars and Lectures
END:VEVENT
END:VCALENDAR