Charles Beall (Stevens Institute of Technology): Towards localized model order reduction for nonlinear parametrized PDEs via a randomized Greedy algorithm
Wednesday, 04.03.2026 14:15 im Raum M5
We design, analyze, and implement a randomized Greedy algorithm that builds certified reduced order models for parametric partial differential equations (PDEs). We show how drawing sample parameters from a clever probability distribution provides certification with high probability over not just the samples, but the entire parameter set, a powerful result that holds even for classes of nonlinear PDEs. Moreover, we demonstrate favorable properties of the algorithm?s sampling complexity to break the curse of dimensionality encountered by e.g. the deterministic Greedy algorithm when choosing a suitable training set. We present preliminary numerical results and discuss the remaining questions in algorithm analysis and implementation. Finally, we discuss the potential of the algorithm to construct localized reduced models for nonlinear multiscale PDEs in a fully local fashion, without relying on simulations of the global computational domain.
Angelegt am 20.02.2026 von Mario Ohlberger
Geändert am 20.02.2026 von Mario Ohlberger
[Edit | Vorlage]
Annika Sophia Raßbach (Disputation): Elementarmathematische Erkenntnisprozesse bei der interaktiven Produktion von Lernvideos - Entwicklung und Erforschung von videobasierten Lernumgebungen in arithmetischen Eingangsveranstaltungen zur fachbezogenen Professionalisierung von Studierenden des Lehramts Primarstufe
Friday, 13.03.2026 10:00 im Raum Raum 214, Institut für Didaktik der Mathematik, Johann-Krane-Weg 39
Maxim Brnic (Disputation): Digitales versus analoges Schulbuch - Eine empirische Studie zur Wirksamkeit des digitalen Schulbuchs im Themenfeld
bedingter Wahrscheinlichkeiten
