Colloque - Evie Nielen : Efficient Greedy Sampling for Model Order Reduction

Épisode de Informatique et sciences numériques (2025-2026) - Yvon Maday par Collège de France · 23 juin 2026 · 33 min

Yvon Maday

Chaire Informatique et sciences numériques

Collège de France

Année 2025-2026

Colloque : Aspects mathématiques et appliqués des méthodes de réduction de complexité - Evie Nielen : Efficient Greedy Sampling for Model Order Reduction

Evie Nielen

Doctoral Candidate, Mathematics and Computer Science, Computational Science, University of Technology Eindhoven, Netherlands

Résumé

This talk presents the Polytope Division Method (PDM), a greedy algorithm for solving high-dimensional configuration optimization problems—such as those arising in model reduction and optimal experimental design—where one seeks an optimal sampling of parameter spaces. Classical approaches like standard greedy sampling rely on fixed training sets and quickly suffer from the curse of dimensionality. PDM replaces global sampling with an adaptive, geometry-driven strategy based on recursive polytope subdivision. At each step, the method evaluates the objective only at samples in dynamically refined regions. This yields a sampling complexity that scales linearly with dimension, avoiding exponential growth. The approach requires no a priori choice of training set size and focuses computational effort where it matters most. Applications to reduced basis methods and empirical interpolation demonstrate strong performance gains. Numerical results show that PDM achieves comparable accuracy to classical methods at significantly lower offline reduced cost.

Autres épisodes de « Informatique et sciences numériques (2025-2026) - Yvon Maday »

• Colloque - Karen E. Willcox : Multifidelity Proper Orthogonal Decomposition 24 juin 2026
• Colloque - Tommaso Taddei : Registration in Bounded Domains for Model Reduction of Parametric Conservation Laws 24 juin 2026
• Colloque - David Ryckelynck : Self Supervised Machine Learning of ROM-nets for Mechanics of Materials 24 juin 2026
• Colloque - Élise Grosjean : A Doubly Reduced Approximation for the Solution to PDEs Based on a Domain Truncation and a Reduced Basis Method: Application to Navier-Stokes Equations 24 juin 2026
• Colloque - Kathrin Smetana : Certified Randomized Model Order Reduction Methods for High-Dimensional Approximation 24 juin 2026
• Colloque - Geneviève Dusson : Metric-Based Nonlinear Model Order Reduction with Applications to Quantum Chemistry 24 juin 2026
• Colloque - Anthony Nouy : Stable Nonlinear Manifold Approximation Using Compositional Networks 24 juin 2026
• Colloque - Ludovic Chamoin : Integrated Structural Health Monitoring with Real-time Data Assimilation and Hybrid Twins 23 juin 2026
• Colloque - Helin Gong : AI-Driven Complexity Reduction and Multi-Physics Digital Twins: From Theory to Engineering Implementation in Nuclear Reactors 23 juin 2026
• Colloque - Clémentine Prieur : Diffeomorphism-Based Feature Learning Using Poincaré Inequalities 23 juin 2026
• Colloque - Benjamin Peherstorfer : Dirac-Frenkel Dynamics with Momentum 23 juin 2026
• Colloque - Andrea Manzoni : Reduced Order Modeling and Scientific Machine Learning: Synergies and Opportunities 23 juin 2026
• Colloque - Albert Cohen : Optimal Linear and Non-Linear Dimensionality Reduction 23 juin 2026
• Colloque - Mario Ohlberger : Reduced Order Surrogate Models for PDE-Constrained Optimization and Inverse Problems 22 juin 2026
• Colloque - Beatriz Moya : Avancées en modélisation hybride : vers la transition numérique des territoires 22 juin 2026

Tous les épisodes de Informatique et sciences numériques (2025-2026) - Yvon Maday · Plus de podcasts Éducation