Musicians make most of their money from live performance these days, but recordings of live concerts can just make you long for the original studio versions. However, there are exceptions. Bruce is one of them. Here is a live version of Hungry Heart. If you want the original for comparison, here it is.

Thu, 08 Jun 2023
14:00
L3

Condition numbers of tensor decompositions

Nick Vannieuwenhoven
(KU Leuven)
Abstract

Tensor decomposition express a tensor as a linear combination of elementary tensors. They have applications in chemometrics, computer science, machine learning, psychometrics, and signal processing. Their uniqueness properties render them suitable for data analysis tasks in which the elementary tensors are the quantities of interest. However, in applications, the idealized mathematical model is corrupted by measurement errors. For a robust interpretation of the data, it is therefore imperative to quantify how sensitive these elementary tensors are to perturbations of the whole tensor. I will give an overview of recent results on the condition number of tensor decompositions, established with my collaborators C. Beltran, P. Breiding, and N. Dewaele.

Modeling Electrode Heterogeneity in Lithium-Ion Batteries: Unimodal and Bimodal Particle-Size Distributions
Kirk, T Evans, J Please, C Chapman, S SIAM Journal on Applied Mathematics volume 82 issue 2 625-653 (14 Apr 2022)
Inefficiency of CFMs: Hedging Perspective and Agent-Based Simulations
Cohen, S Sabate-Vidales, M Siska, D Szpruch, L
New lower bounds for cardinalities of higher dimensional difference sets and sumsets
Mudgal, A Discrete Analysis volume 2022 issue 15 1-19 (01 Dec 2022)
A new definition of rough paths on manifolds
Boutaib, Y Lyons, T Annales de la Faculté des sciences de Toulouse : Mathématiques volume 31 issue 4 1223-1258 (28 Oct 2022)
Mon, 05 Jun 2023

14:00 - 15:00
Lecture Room 6

Embedded Deep Learning for Prediction and Control of Complex Turbulent Flows

Professor Jonathan F. MacArt
Abstract

Accurately predicting turbulent fluid mechanics remains a significant challenge in engineering and applied science. Reynolds-Averaged Navier–Stokes (RANS) simulations and Large-Eddy Simulation (LES) are generally accurate, though non-Boussinesq turbulence and/or unresolved multiphysical phenomena can preclude predictive accuracy in certain regimes. In turbulent combustion, flame–turbulence interactions lead to inverse-cascade energy transfer, which violates the assumptions of many RANS and LES closures. We survey the regime dependence of these effects using a series of high-resolution Direct Numerical Simulations (DNS) of turbulent jet flames, from which an intermediate regime of heat-release effects, associated with the hypothesis of an “active cascade,” is apparent, with severe implications for physics- and data-driven closure models. We apply adjoint-based data assimilation method to augment the RANS and LES equations using trusted (though not necessarily high-fidelity) data. This uses a Python-native flow solver that leverages differentiable-programming techniques, automatic construction of adjoint equations, and solver-in-the-loop optimization. Applications to canonical turbulence, shock-dominated flows, aerodynamics, and flow control are presented, and opportunities for reacting flow modeling are discussed.

Mon, 12 Jun 2023

15:30 - 16:30
L3

On the multi-indices approach to path-wise stochastic analysis

Lorenzo Zambotti
Abstract

Recently Linares-Otto-Tempelmayr have unveiled a very interesting algebraic structure which allows to define a new class of rough paths/regularity structures, with associated applications to stochastic PDEs or ODEs. This approach does not consider trees as combinatorial tools but their fertility, namely the function which associates to each integer k the number of vertices in the tree with exactly k children. In a joint work with J-D Jacques we have studied this algebraic structure and shown that it is related with a general and simple class of so-called post-Lie algebras. The construction has remarkable properties and I will try to present them in the simplest possible way.

Subscribe to