Skip to main content

Graduate seminar SS 25 Graduate Seminar on Efficient Simulation

Randomized sketching algorithms

Offered by
Prof. Jürgen Dölz
Preliminary meeting
Thursday, 30 January 2025, 10:15
Place
INS Room 2.035
Registration
Please write me an email and register via BASIS

Traditional methods of numerical linear algebra often have a computational complexity which makes them too costly for larger problems. In certain problem classes, randomized algorithms can provide approximations to the true solution up to an astonishing complexity. In the seminar we will discuss such algorithms and their theoretical background.