![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Applied and Computational Analysis > Randomized sketching of Krylov methods in numerical linear algebra
![]() Randomized sketching of Krylov methods in numerical linear algebraAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Matthew Colbrook. Many large-scale computations in numerical linear algebra are powered by Krylov methods, including the solution of linear systems of equations, least squares problems, linear and nonlinear eigenvalue problems, matrix functions and matrix equations, etc. We will discuss some recent ideas to speed up Krylov methods for these tasks using randomized sketching, and highlight some of the key challenges for future research. This talk is part of the Applied and Computational Analysis series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsSymposium on Computational Biology Pathology Valedictory Seminars CAPE Advanced Technology Lecture SeriesOther talksSummary Double-edged swords: innate and adaptive immune factors that inhibit or promote SARS-CoV-2 entry Gateway OfB MWS Recovering DNA and proteins from ancient books to explore livestock management and craft The Lyman-alpha cosmic web in IllustrisTNG Electromagnetic homogenization with the strong-property-fluctuation theory |