Publikationen
Artikel in Referierten Journalen

G. Hu, A. Rathsfeld, Radiation conditions for the Helmholtz equation in a half plane filled by inhomogeneous periodic material, Journal of Differential Equations, 388 (2024), pp. 215252, DOI 10.1016/j.jde.2024.01.008 .
Abstract
In this paper we consider timeharmonic acoustic wave propagation in a halfplane filled by inhomogeneous periodic medium. If the refractive index depends on the horizontal coordinate only, we define upward and downward radiating modes by solving a onedimensional SturmLiouville eigenvalue problem with a complexvalued periodic coefficient. The upward and downward radiation conditions are introduced based on a generalized Rayleigh series. Using the variational method, we then prove uniqueness and existence for the scattering of an incoming wave mode by a grating located between an upper and lower half plane with such inhomogeneous periodic media. Finally, we discuss the application of the new radiation conditions to the scattering matrix algorithm, i.e., to rigorous coupled wave analysis or Fourier modal method. 
M. Drieschner, R. Gruhlke, Y. Petryna, M. Eigel, D. Hömberg, Local surrogate responses in the Schwarz alternating method for elastic problems on random voided domains, Computer Methods in Applied Mechanics and Engineering, 405 (2023), pp. 115858/1115858/18, DOI 10.1016/j.cma.2022.115858 .
Abstract
Imperfections and inaccuracies in real technical products often influence the mechanical behavior and the overall structural reliability. The prediction of real stress states and possibly resulting failure mechanisms is essential and a real challenge, e.g. in the design process. In this contribution, imperfections in elastic materials such as air voids in adhesive bonds between fiberreinforced composites are investigated. They are modeled as arbitrarily shaped and positioned. The focus is on local displacement values as well as on associated stress concentrations caused by the imperfections. For this purpose, the resulting complex random onescale finite element model is numerically solved by a new developed surrogate model using an overlapping domain decomposition scheme based on Schwarz alternating method. Here, the actual response of local subproblems associated with isolated material imperfections is determined by a single appropriate surrogate model, that allows for an accelerated propagation of randomness. The efficiency of the method is demonstrated for imperfections with elliptical and ellipsoidal shape in 2D and 3D and extended to arbitrarily shaped voids. For the latter one, a local surrogate model based on artificial neural networks (ANN) is constructed. Finally, a comparison to experimental results validates the numerical predictions for a real engineering problem. 
M. EbelingRump, D. Hömberg, R. Lasarzik, On a twoscale phasefield model for topology optimization, Discrete and Continuous Dynamical Systems  Series S, published online on 26.11.2023, DOI 10.3934/dcdss.2023206 .
Abstract
In this article, we consider a gradient flow stemming from a problem in twoscale topology optimization. We use the phasefield method, where a GinzburgLandau term with obstacle potential is added to the cost functional, which contains the usual compliance but also an additional contribution including a local volume constraint in a penalty term. The minimization of such an energy by its gradientflow is analyzed in this paper. We use an regularization and discretization of the associated statevariable to show the existence of weak solutions to the considered system. 
M. Gugat, H. Heitsch, R. Henrion, A turnpike property for optimal control problems with dynamic probabilistic constraints, Journal of Convex Analysis, 30 (2023), pp. 10251052.
Abstract
In this paper we consider systems that are governed by linear timediscrete dynamics with an initial condition, additive random perturbations in each step and a terminal condition for the expected values. We study optimal control problems where the objective function consists of a term of tracking type for the expected values and a control cost. In addition, the feasible states have to satisfy a conservative probabilistic constraint that requires that the probability that the trajectories remain in a given set F is greater than or equal to a given lower bound. An application are optimal control problems related to storage management systems with uncertain in and output. We give sufficient conditions that imply that the optimal expected trajectories remain close to a certain state that can be characterized as the solution of an optimal control problem without prescribed initial and terminal condition. In this way we contribute to the study of the turnpike phenomenon that is wellknown in mathematical economics and make a step towards the extension of the turnpike theory to problems with probabilistic constraints. 
C. Heiss, I. Gühring, M. Eigel, Multilevel CNNs for parametric PDEs, Journal of Machine Learning Research (JMLR). MIT Press, Cambridge, MA. English, English abstracts., 24 (2023), pp. 373/1373/42.
Abstract
We combine concepts from multilevel solvers for partial differential equations (PDEs) with neural network based deep learning and propose a new methodology for the efficient numerical solution of highdimensional parametric PDEs. An indepth theoretical analysis shows that the proposed architecture is able to approximate multigrid Vcycles to arbitrary precision with the number of weights only depending logarithmically on the resolution of the finest mesh. As a consequence, approximation bounds for the solution of parametric PDEs by neural networks that are independent on the (stochastic) parameter dimension can be derived.The performance of the proposed method is illustrated on highdimensional parametric linear elliptic PDEs that are common benchmark problems in uncertainty quantification. We find substantial improvements over stateoftheart deep learningbased solvers. As particularly challenging examples, random conductivity with highdimensional nonaffine Gaussian fields in 100 parameter dimensions and a random cookie problem are examined. Due to the multilevel structure of our method, the amount of training samples can be reduced on finer levels, hence significantly lowering the generation time for training data and the training time of our method.

CH. Bayer, M. Eigel, L. Sallandt, P. Trunschke, Pricing highdimensional Bermudan options with hierarchical tensor formats, SIAM Journal on Financial Mathematics, ISSN 1945497X, 14 (2023), pp. 383406, DOI 10.1137/21M1402170 .

M. Eigel, N. Farchmin, S. Heidenreich, P. Trunschke, Adaptive nonintrusive reconstruction of solutions to highdimensional parametric PDEs, SIAM Journal on Scientific Computing, 45 (2023), pp. A457A479, DOI 10.1137/21M1461988 .
Abstract
Numerical methods for random parametric PDEs can greatly benefit from adaptive refinement schemes, in particular when functional approximations are computed as in stochastic Galerkin and stochastic collocations methods. This work is concerned with a nonintrusive generalization of the adaptive Galerkin FEM with residual based error estimation. It combines the nonintrusive character of a randomized leastsquares method with the a posteriori error analysis of stochastic Galerkin methods. The proposed approach uses the Variational Monte Carlo method to obtain a quasioptimal lowrank approximation of the Galerkin projection in a highly efficient hierarchical tensor format. We derive an adaptive refinement algorithm which is steered by a reliable error estimator. Opposite to stochastic Galerkin methods, the approach is easily applicable to a wide range of problems, enabling a fully automated adjustment of all discretization parameters. Benchmark examples with affine and (unbounded) lognormal coefficient fields illustrate the performance of the nonintrusive adaptive algorithm, showing bestinclass performance. 
M. Eigel, N. Farchmin, S. Heidenreich, P. Trunschke, Efficient approximation of highdimensional exponentials by tensor networks, International Journal for Uncertainty Quantification, 13 (2023), pp. 2551, DOI 10.1615/Int.J.UncertaintyQuantification.2022039164 .
Abstract
In this work a general approach to compute a compressed representation of the exponential exp(h) of a highdimensional function h is presented. Such exponential functions play an important role in several problems in Uncertainty Quantification, e.g. the approximation of lognormal random fields or the evaluation of Bayesian posterior measures. Usually, these highdimensional objects are intractable numerically and can only be accessed pointwise in sampling methods. In contrast, the proposed method constructs a functional representation of the exponential by exploiting its nature as a solution of an ordinary differential equation. The application of a PetrovGalerkin scheme to this equation provides a tensor train representation of the solution for which we derive an efficient and reliable a posteriori error estimator. Numerical experiments with a lognormal random field and a Bayesian likelihood illustrate the performance of the approach in comparison to other recent lowrank representations for the respective applications. Although the present work considers only a specific differential equation, the presented method can be applied in a more general setting. We show that the composition of a generic holonomic function and a highdimensional function corresponds to a differential equation that can be used in our method. Moreover, the differential equation can be modified to adapt the norm in the a posteriori error estimates to the problem at hand. 
R. Henrion, A. Jourani, B.S. Mordukhovich, Controlled polyhedral sweeping processes: Existence, stability, and optimality conditions, Journal of Differential Equations, 366 (2023), pp. 408443, DOI https://doi.org/10.1016/j.jde.2023.04.010 .
Abstract
This paper is mainly devoted to the study of controlled sweeping processes with polyhedral moving sets in Hilbert spaces. Based on a detailed analysis of truncated Hausdorff distances between moving polyhedra, we derive new existence and uniqueness theorems for sweeping trajectories corresponding to various classes of control functions acting in moving sets. Then we establish quantitative stability results, which provide efficient estimates on the sweeping trajectory dependence on controls and initial values. Our final topic, accomplished in finitedimensional state spaces, is deriving new necessary optimality and suboptimality conditions for sweeping control systems with endpoint constrains by using constructive discrete approximations. 
D. Hömberg, R. Lasarzik, L. Plato, On the existence of generalized solutions to a spatiotemporal predatorprey system with preytaxis, Journal of Evolution Equations, 23 (2023), pp. 20/120/44, DOI 10.1007/s00028023008715 .
Abstract
In this paper we consider a pair of coupled nonlinear partial differential equations describing the interaction of a predatorprey pair. We introduce a concept of generalized solutions and show the existence of such solutions in all space dimension with the aid of a regularizing term, that is motivated by overcrowding phenomena. Additionally, we prove the weakstrong uniqueness of these generalized solutions and the existence of strong solutions at least locallyintime for space dimension two and three. 
R. Lasarzik, M.E.V. Reiter, Analysis and numerical approximation of energyvariational solutions to the EricksenLeslie equations, Acta Applicandae Mathematicae. An International Survey Journal on Applying Mathematics and Mathematical Applications, 184 (2023), pp. 11/111/44, DOI 10.1007/s10440023005639 .
Abstract
We define the concept of energyvariational solutions for the EricksenLeslie equations in three spatial dimensions. This solution concept is finer than dissipative solutions and satisfies the weakstrong uniqueness property. For a certain choice of the regularity weight, the existence of energyvariational solutions implies the existence of measurevalued solutions and for a different choice, we construct an energyvariational solution with the help of an implementable, structureinheriting spacetime discretization. Computational studies are performed in order to provide some evidence of the applicability of the proposed algorithm. 
R. Lasarzik, On the existence of energyvariational solutions in the context of multidimensional incompressible fluid dynamics, Mathematical Methods in the Applied Sciences, 47 (2024), pp. 43194344 (published online on 20.12.2023), DOI 10.1002/mma.9816 .
Abstract
We define the concept of energyvariational solutions for the NavierStokes and Euler equations. This concept is shown to be equivalent to weak solutions with energy conservation. Via a standard Galerkin discretization, we prove the existence of energyvariational solutions and thus weak solutions in any space dimension for the NavierStokes equations. In the limit of vanishing viscosity the same assertions are deduced for the incompressible Euler system. Via the selection criterion of maximal dissipation we deduce wellposedness for these equations.
Preprints, Reports, Technical Reports

A. Rathsfeld, Convergence of the method of rigorous coupledwave analysis for the diffraction by twodimensional periodic surface structures, Preprint no. 3081, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3081 .
Abstract, PDF (424 kByte)
The scattering matrix algorithm is a popular numerical method to simulate the diffraction of optical waves by periodic surfaces. The computational domain is divided into horizontal slices and, by a domain decomposition method coupling neighbour slices over the common interface via scattering data, a clever recursion is set up to compute an approximate operator, mapping incoming waves into outgoing. Combining this scattering matrix algorithm with numerical schemes inside the slices, methods like rigorous coupled wave analysis and Fourier modal methods were designed. The key for the analysis is the scattering problem over the slices. These are scattering problems with a radiation condition generalized for inhomogeneous cover and substrate materials and were first analyzed in [7]. In contrast to [7], where the scattering matrix algorithm for transverse electric polarization was treated without full discretization (no approximation by truncated Fourier series), we discuss the more challenging case of transverse magnetic polarization and look at the convergence of the fullydiscretized scheme, i.e., at the rigorous coupled wave analysis for a fixed slicing into layers with vertically invariant optical index. 
M.J. Arenas, D. Hömberg, R. Lasarzik, Optimal beam forming for laser materials processing, Preprint no. 3080, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3080 .
Abstract, PDF (2441 kByte)
We investigate an optimal control problem related to laser material treatments such as welding, remelting, hardening, or the 3D printing of metal components. The mathematical model leads to the investigation of a quasilinear elliptic state system with additional nonmonotone loweroder terms. We analyze the state system, derive first order optimality conditions and show first results for beam shaping. 
M. Eigel, Ch. Miranda, Functional SDE approximation inspired by a deep operator network architecture, Preprint no. 3079, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3079 .
Abstract, PDF (755 kByte)
We present a novel approach to solve Stochastic Differential Equations (SDEs) with Deep Neural Networks by a Deep Operator Network (DeepONet) architecture. The notion of DeepONets relies on operator learning in terms of a reduced basis. We make use of a polynomial chaos expansion (PCE) of stochastic processes and call the corresponding architecture SDEONet. The PCE has been used extensively in the area of uncertainty quantification with parametric partial differential equations. This however is not the case with SDE, where classical sampling methods dominate and functional approaches are seen rarely. A main challenge with truncated PCEs occurs due to the drastic growth of the number of components with respect to the maximum polynomial degree and the number of basis elements. The proposed SDEONet architecture aims to alleviate the issue of exponential complexity by learning a sparse truncation of the Wiener chaos expansion. A complete convergence analysis is presented, making use of recent Neural Network approximation results. Numerical experiments illustrate the promising performance of the suggested approach in 1D and higher dimensions. 
D. Sommer, R. Gruhlke, M. Kirstein, M. Eigel, C. Schillings, Generative modelling with tensor train approximations of HamiltonJacobiBellman equations, Preprint no. 3078, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3078 .
Abstract, PDF (2117 kByte)
Sampling from probability densities is a common challenge in fields such as Uncertainty Quantification (UQ) and Generative Modelling (GM). In GM in particular, the use of reversetime diffusion processes depending on the logdensities of OrnsteinUhlenbeck forward processes are a popular sampling tool. In [5] the authors point out that these logdensities can be obtained by solution of a HamiltonJacobiBellman (HJB) equation known from stochastic optimal control. While this HJB equation is usually treated with indirect methods such as policy iteration and unsupervised training of blackbox architectures like Neural Networks, we propose instead to solve the HJB equation by direct time integration, using compressed polynomials represented in the Tensor Train (TT) format for spatial discretization. Crucially, this method is samplefree, agnostic to normalization constants and can avoid the curse of dimensionality due to the TT compression. We provide a complete derivation of the HJB equation?s action on Tensor Train polynomials and demonstrate the performance of the proposed timestep, rank and degreeadaptive integration method on a nonlinear sampling task in 20 dimensions. 
M. Eigel, Ch. Miranda, J. Schütte, D. Sommer, Approximating Langevin Monte Carlo with ResNetlike neural network architectures, Preprint no. 3077, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3077 .
Abstract, PDF (795 kByte)
We sample from a given target distribution by constructing a neural network which maps samples from a simple reference, e.g. the standard normal distribution, to samples from the target. To that end, we propose using a neural network architecture inspired by the Langevin Monte Carlo (LMC) algorithm. Based on LMC perturbation results, we show approximation rates of the proposed architecture for smooth, logconcave target distributions measured in the Wasserstein2 distance. The analysis heavily relies on the notion of subGaussianity of the intermediate measures of the perturbed LMC process. In particular, we derive bounds on the growth of the intermediate variance proxies under different assumptions on the perturbations. Moreover, we propose an architecture similar to deep residual neural networks and derive expressivity results for approximating the sample to target distribution map. 
N. Ouanes, T. González Grandón, H. Heitsch, R. Henrion, Optimizing the economic dispatch of weaklyconnected minigrids under uncertainty using joint chance constraints, Preprint no. 3069, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3069 .
Abstract, PDF (1681 kByte)
In this paper, we deal with a renewablepowered minigrid, connected to an unreliable main grid, in a Joint Chance Constrained (JCC) programming setting. In several rural areas in Africa with low energy access rates, gridconnected minigrid system operators contend with four different types of uncertainties: forecasting errors of solar power and load; frequency and outages duration from the maingrid. These uncertainties pose new challenges to the classical power system's operation tasks. Three alternatives to the JCC problem are presented. In particular, we present an Individual Chance Constraint (ICC), ExpectedValue Model (EVM) and a so called regular model that ignores outages and forecasting uncertainties. The JCC model has the capability to guarantee a high probability of meeting the local demand throughout an outage event by keeping appropriate reserves for Diesel generation and battery discharge. In contrast, the easier to handle ICC model guarantees such probability only individually for different time steps, resulting in a much less robust dispatch. The even simpler EVM focuses solely on average values of random variables. We illustrate the four models through a comparison of outcomes attained from a real minigrid in Lake Victoria, Tanzania. The results show the dispatch modifications for battery and Diesel reserve planning, with the JCC model providing the most robust results, albeit with a small increase in costs. 
H. Heitsch, R. Henrion, C. Tischendorf, Probabilistic maximization of timedependent capacities in a gas network, Preprint no. 3066, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3066 .
Abstract, PDF (421 kByte)
The determination of free technical capacities belongs to the core tasks of a gas network owner. Since gas loads are uncertain by nature, it makes sense to understand this as a probabilistic problem as far as stochastic modeling of available historical data is possible. Future clients, however, don?t have a history or they do not behave in a random way, as is the case, for instance, in gas reservoir management. Therefore, capacity maximization turns into an optimization problem with uncertaintyrelated constrained which are partially of probabilistic and partially of robust (worst case) type. While previous attempts to solve this problem had be devoted to models with static (timeindependent) gas flow, we aim at considering here transient gas flow subordinate to a PDE (Euler equations). The basic challenge here is twofold: first, a proper way of joining probabilistic constraints to the differential equations has to be found. This will be realized on the basis of the socalled sphericalradial decomposition of Gaussian random vectors. Second, a suitable characterization of the worstcase load behaviour of future customers has to be figured out. It will be shown, that this is possible for quasistatic flow and can be transferred to the transient case. The complexity of the problem forces us to constrain ourselves in this first analysis to simple pipes or to a Vlike structure of the network. Numerical solutions are presented and show that the differences between quasistatic and transient solutions are small, at least in these elementary examples. 
C. Geiersbach, R. Henrion, P. PérezAroz, Numerical solution of an optimal control problem with probabilistic and almost sure state constraints, Preprint no. 3062, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3062 .
Abstract, PDF (779 kByte)
We consider the optimal control of a PDE with random source term subject to probabilistic or almost sure state constraints. In the main theoretical result, we provide an exact formula for the Clarke subdifferential of the probability function without a restrictive assumption made in an earlier paper. The focus of the paper is on numerical solution algorithms. As for probabilistic constraints, we apply the method of spherical radial decomposition. Almost sure constraints are dealt with a MoreauYosida smoothing of the constraint function accompanied by Monte Carlo sampling of the given distribution or its support or even just the boundary of its support. Moreover, one can understand the almost sure constraint as a probabilistic constraint with safety level one which offers yet another perspective. Finally, robust optimization can be applied efficiently when the support is sufficiently simple. A comparative study of these five different methodologies is carried out and illustrated. 
W. VAN Ackooij, R. Henrion, H. Zidani, Pontryagin's principle for some probabilistic control problems, Preprint no. 3050, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3050 .
Abstract, PDF (472 kByte)
In this paper we investigate optimal control problems perturbed by random events. We assume that the control has to be decided prior to observing the outcome of the perturbed state equations. We investigate the use of probability functions in the objective function or constraints to define optimal or feasible controls. We provide an extension of differentiability results for probability functions in infinite dimensions usable in this context. These results are subsequently combined with the optimal control setting to derive a novel Pontryagin's optimality principle. 
P. Trunschke, M. Eigel, A. Nouy, Weighted sparsity and sparse tensor networks for least squares approximation, Preprint no. 3049, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3049 .
Abstract, PDF (954 kByte)
The approximation of highdimensional functions is a ubiquitous problem in many scientific fields that is only feasible practically if advantageous structural properties can be exploited. One prominent structure is sparsity relatively to some basis. For the analysis of these best nterm approximations a relevant tool is the Stechkin's lemma. In its standard form, however, this lemma does not allow to explain convergence rates for a wide range of relevant function classes. This work presents a new weighted version of Stechkin's lemma that improves the best nterm rates for weighted ℓ^{p}spaces and associated function classes such as Sobolev or Besov spaces. For the class of holomorphic functions, which for example occur as solutions of common highdimensional parameter dependent PDEs, we recover exponential rates that are not directly obtainable with Stechkin's lemma. This sparsity can be used to devise weighted sparse least squares approximation algorithms as known from compressed sensing. However, in highdimensional settings, classical algorithms for sparse approximation suffer the curse of dimensionality. We demonstrate that sparse approximations can be encoded efficiently using tensor networks with sparse component tensors. This representation gives rise to a new alternating algorithm for best nterm approximation with a complexity scaling polynomially in n and the dimension. We also demonstrate that weighted ℓ_{p}summability not only induces sparsity of the tensor but also low ranks. This is not exploited by the previous format. We thus propose a new lowrank tensor train format with a single weighted sparse core tensor and an adhoc algorithm for approximation in this format. To analyse the sample complexity for this new model class we derive a novel result of independent interest that allows to transfer the restricted isometry property from one set to another sufficiently close set. We then prove that the new model class is close enough to the set of weighted sparse vectors such that the restricted isometry property transfers. Numerical examples illustrate the theoretical results for a benchmark problem from uncertainty quantification. Although they lead up to the analysis of our final model class, our contributions on weighted Stechkin and the restricted isometry property are of independent interest and can be read independently. 
A. Agosti, R. Lasarzik, E. Rocca, Energyvariational solutions for viscoelastic fluid models, Preprint no. 3048, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3048 .
Abstract, PDF (329 kByte)
In this article, we introduce the concept of energyvariational solutions for a large class of systems of nonlinear evolutionary partial differential equations. Under certain convexity assumptions, the existence of such solutions can be shown constructively by an adapted minimizing movement scheme. Weakstrong uniqueness follows by a suitable relative energy inequality.
Our main motivation is to apply the general framework to viscoelastic fluid models. Therefore, we give a short overview on different versions of such models and their derivation. The abstract result is applied to two of these viscoelastic fluid models in full detail. In the conclusion, we comment on further applications of the general theory and its possible impact. 
M. Eigel, N. Hegemann, Guaranteed quasierror reduction of adaptive Galerkin FEM for parametric PDEs with lognormal coefficients, Preprint no. 3036, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3036 .
Abstract, PDF (394 kByte)
Solving highdimensional random parametric PDEs poses a challenging computational problem. It is wellknown that numerical methods can greatly benefit from adaptive refinement algorithms, in particular when functional approximations in polynomials are computed as in stochastic Galerkin and stochastic collocations methods. This work investigates a residual based adaptive algorithm used to approximate the solution of the stationary diffusion equation with lognormal coefficients. It is known that the refinement procedure is reliable, but the theoretical convergence of the scheme for this class of unbounded coefficients remains a challenging open question. This paper advances the theoretical results by providing a quasierror reduction results for the adaptive solution of the lognormal stationary diffusion problem. A computational example supports the theoretical statement. 
C. Geiersbach, R. Henrion, Optimality conditions in control problems with random state constraints in probabilistic or almostsure form, Preprint no. 3021, WIAS, Berlin, 2023, DOI 10.20347/WIAS.PREPRINT.3021 .
Abstract, PDF (355 kByte)
In this paper, we discuss optimality conditions for optimization problems subject to random state constraints, which are modeled in probabilistic or almost sure form. While the latter can be understood as the limiting case of the former, the derivation of optimality conditions requires substantially different approaches. We apply them to a linear elliptic partial differential equation (PDE) with random inputs. In the probabilistic case, we rely on the sphericalradial decomposition of Gaussian random vectors in order to formulate fully explicit optimality conditions involving a spherical integral. In the almost sure case, we derive optimality conditions and compare them to a model based on robust constraints with respect to the (compact) support of the given distribution.
Vorträge, Poster

J. Schütte, Approximating Langevin Monte Carlo with resnetlike neural network architectures, 94th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM 2024), Session 25.02 ``Various Topics in Computational and Mathematical Methods in Datascience'', March 18  22, 2024, OttovonGuerickeUniversität Magdeburg, March 20, 2024.

J. Schütte, Bayes for parametric PDEs with normalizing flows, SIAM Conference on Uncertainty Quantification (UQ24), Minisymposium MS37 ``Forward and Inverse Uncertainty Quantification for Nonlinear Problems  Part II'', February 27  March 1, 2024, Savoia Excelsior Palace Trieste and Stazione Marittima, Italy, February 27, 2024.

V. Aksenov, Learning distributions with regularized JKO scheme and lowrank tensor decompositions, Workshop on Optimal Transport from Theory to Applications, Berlin, March 11  15, 2024.

V. Aksenov, Learning distributions with regularized JKO scheme and lowrank tensor decompositions, SIAM Conference on Uncertainty Quantification (UQ24), Minisymposium MS153 ``Low Rank Methods for Random Dynamical Systems and Sequential Data Assimilation  Part I'', February 27  March 1, 2024, Savoia Excelsior Palace Trieste and Stazione Marittima, Italy, February 29, 2024.

V. Aksenov, Modelling distributions with Wasserstein proximal methods and lowrank tensor decompositions, 94th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM 2024), Session 15.06 ``UQ  Sampling and Rare Events Estimation'', March 18  22, 2024, OttovonGuerickeUniversität Magdeburg, March 21, 2024.

CH. Miranda, Functional SDE approximation inspired by a deep operator network architecture, 94th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM 2024), Session 25.02 ``Various Topics in Computational and Mathematical Methods in Datascience'', March 18  22, 2024, OttovonGuerickeUniversität Magdeburg, March 19, 2024.

CH. Miranda, Solving stochastic differential equations using deep operator networks, SIAM Conference on Uncertainty Quantification (UQ24), Minisymposium MS25 ``Nonlinear Approximation of HighDimensional Functions: Compositional, LowRank and Sparse Structures  Part II'', February 27  March 1, 2024, Savoia Excelsior Palace Trieste and Stazione Marittima, Italy, February 27, 2024.

D. Sommer, Approximating Langevin Monte Carlo with ResNetlike neural network architecture (online talk), University of Tokyo, Graduate School of Mathematical Sciences, Japan, March 13, 2024.

D. Sommer, Approximating Langevin Monte Carlo with resnetlike neural network architectures, SIAM Conference on Uncertainty Quantification (UQ24), Minisymposium MS25 ``Nonlinear Approximation of HighDimensional Functions: Compositional, LowRank and Sparse Structures  Part II'', February 27  March 1, 2024, Savoia Excelsior Palace Trieste and Stazione Marittima, Italy, February 27, 2024.

M. Eigel, Adaptive multilevel neural networks for parametric PDEs with error control, 94th Annual Meeting of the International Association of Applied Mathematics and Mechanics (GAMM 2024), Session 15.05 ``Methodologies for Forward UQ'', March 18  22, 2024, OttovonGuerickeUniversität Magdeburg, March 20, 2024.

M. Eigel, An operator network architecture for functional SDE representations, SIAM Conference on Uncertainty Quantification (UQ24), Minisymposium MS6 ``Operator Learning in Uncertainty Quantification  Part I'', February 27  March 1, 2024, Savoia Excelsior Palace Trieste and Stazione Marittima, Italy, February 27, 2024.

R. Henrion, On a chanceconstrained optimal control problem with turnpike property, 3rd International Conference on Variational Analysis and Optimization, January 16  19, 2024, Universidad de Chile, Santiago, Chile, January 16, 2024.

R. Lasarzik, Minimizing movements for damped Hamiltonian systems, Workshop on Optimal Transport from Theory to Applications, Berlin, March 11  15, 2024.

A. Rathsfeld, Analysis of scattering matrix algorithm for diffraction by periodic structures (online talk), University of Tokyo, Graduate School of Mathematical Sciences, Japan, March 13, 2024.

N. Kliche, A numerical approach for the optimal operation of minigrids under uncertainty, 22nd European Conference on Mathematics for Industry (ECMI2023), MS17 ``ECMI SIG: Mathematics for the Digital Factory'', June 26  30, 2023, Wrocław University of Science and Technology Congress Centre, Poland, June 26, 2023.

L. Plato, R. Lasarzik, D. Hömberg, E. Emmrich, Nonlinear electrokinetics in anisotropic microfluids  Analysis, simulation, and optimal control, MATH+ Day, HumboldtUniversität zu Berlin, October 20, 2023.

L. Plato, Existence of weak solutions to an anisotropic electrokinetic flow model, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00874 ``Recent Advances in the Analysis and Numerics for PhaseField Models'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 22, 2023.

J. Schütte, A neural network architecture for sampling, WIAS Days, March 6  7, 2024, HumboldtUniversität zu Berlin, March 6, 2024.

J. Schütte, Adaptive multilevel neural networks for parametric PDEs with error estimation, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00960 ``Hierarchical Low Rank Tensors and DNNs for Highdimensional Approximation'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 23, 2023.

J. Schütte, Adaptive neural networks for parametric PDEs, 5th International Conference on Uncertainty Quantification in Computational Science and Engineering (UNCECOMP 2023), MS9 ``UQ and Data Assimilation with Sparse, Lowrank Tensor, and Machine Learning Methods'', June 12  14, 2023, Athens, Greece, June 14, 2023.

J. Schütte, Adaptive neural networks for parametric PDEs, MiniWorkshop ``Nonlinear Approximation of Highdimensional Functions in Scientific Computing, October 15  20, 2023, Mathematisches Forschungsinstitut Oberwolfach, October 20, 2023.

J. Schütte, Neural and tensor networks for parametric PDEs and inverse problems, Annual Meeting of SPP 2298, November 5  8, 2023, Evangelische Akademie, Tutzing, November 8, 2023.

J. Schütte, Neural networks as surrogates for parameterdependent ordinary differential equations, ESGI 175  The Berlin Study Group with Industry, September 18  22, 2023, WIAS Berlin, September 22, 2023.

V. Aksenov, Simulation of Wasserstein gradient flows with lowrank tensor methods for sampling, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00837 ``Particle Methods for Bayesian Inference'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 24, 2023.

H. Heitsch, Probabilistic maximization of timedependent capacities in a gas network, Frontiers of Stochastic Optimization and its Applications in Industry, WIAS, Berlin, May 11, 2023.

CH. Miranda, Approximating Langevin Monte Carlo with ResNetlike neural network architectures, MiniWorkshop ``Nonlinear Approximation of Highdimensional Functions in Scientific Computing'', October 15  20, 2023, Mathematisches Forschungsinstitut Oberwolfach, October 18, 2023.

J. Polzehl, Smoothing techniques for quantitative MR, colloquium, Marquette University, Department of Mathematical and Statistical Sciences, Milwaukee, USA, November 3, 2023.

D. Sommer, Computing logdensities of reversetime diffusion processes through HamiltonJacobiBellman equations (online talk), University of Tokyo, Graduate School of Mathematical Sciences, Japan, November 30, 2023.

D. Sommer, Computing logdensities of timereversed diffusion processes through HamiltonJacobiBellman equations, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00837 ``Particle Methods for Bayesian Inference'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 24, 2023.

D. Sommer, Industrial testing via reinforcement learning with tensor trains, ESGI 175  The Berlin Study Group with Industry, September 18  22, 2023, WIAS Berlin, September 22, 2023.

D. Sommer, Less interaction with forward models in Langevin dynamics, Centrale Nantes, Laboratoire de Mathématiques Jean Leray, France, June 27, 2023.

D. Sommer, Robust model predictive control for digital twins using feedback laws, Leibniz MMS Days 2023, April 17  19, 2023, LeibnizInstitut für Agrartechnik und Bioökonomie (ATB), Potsdam, April 18, 2023.

M. Eigel, M. Heida, M. Landstorfer, A. Selahi, Recovery of battery ageing dynamics with multiple timescales, MATH+ Day, HumboldtUniversität zu Berlin, October 20, 2023.

M. Eigel, Accelerated interacting particle systems with lowrank tensor compression for Bayesian inversion, 5th International Conference on Uncertainty Quantification in Computational Science and Engineering (UNCECOMP 2023), MS9 ``UQ and Data Assimilation with Sparse, Lowrank Tensor, and Machine Learning Methods'', June 12  14, 2023, Athens, Greece, June 14, 2023.

M. Eigel, Accelerated interacting particle transport for Bayesian inversion, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00966 ``Theoretical and Computational Advances in Measure Transport'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 21, 2023.

M. Eigel, Convergence of adaptive empirical stochastic Galerkin FEM, ECCOMAS Young Investigators Conference (YIC2023), Minisymposium CAM01 ``Uncertainty Quantification of Differential Equations with Random Parameters: Methods and Applications'', June 19  21, 2023, University of Porto, June 19, 2023.

M. Eigel, Convergence of an empirical Galerkin method for parametric PDEs, SIAM Conference on Computational Science and Engineering (CSE23), Minisymposium MS100 ``Randomized Solvers in LargeScale Scientific Computing'', February 26  March 3, 2023, Amsterdam, Netherlands, February 28, 2023.

M. Eigel, Convergence of empirical Galerkin FEM for parametric PDEs with sparse TTs, Universität Basel, Departement Mathematik und Informatik, Switzerland, May 12, 2023.

M. Eigel, Functional SDE approximation inspired by a deep operator network architecture, MiniWorkshop ``Nonlinear Approximation of Highdimensional Functions in Scientific Computing'', October 15  20, 2023, Mathematisches Forschungsinstitut Oberwolfach, October 18, 2023.

TH. Eiter, R. Lasarzik, Analysis of energyvariational solutions for hyperbolic conservation laws, Presentation of project proposals in SPP 2410 ``Hyperbolic Balance Laws in Fluid Mechanics: Complexity, Scales, Randomness'', Bad Honnef, April 28, 2023.

R. Henrion, D. Hömberg, N. Kliche, Modeling and simulation of minigrids under uncertainty, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Tokyo, Japan, August 20  25, 2023.

R. Henrion, A control problem with random state constraints in probabilistic and almostsure form, PGMO DAYS 2023, Session 10B ``Stochastic Optimization'', November 28  29, 2023, Gaspard Monge Program for Optimization, Operations Research and their Interaction with Data Science, EDF Lab ParisSaclay, Palaiseau, France, November 29, 2023.

R. Henrion, Chance constraints in optimal control, ALOP colloquium, Universität Trier, Graduiertenkolleg ALOP, April 24, 2023.

R. Henrion, Existence and stability in controlled polyhedral sweeping processes (online talk), International Workshop on Nonsmooth Optimization: Theory, Algorithms and Applications (NOTAA2023) (Online Event), June 7  8, 2023, University of Isfahan, Iran, June 8, 2023.

R. Henrion, Optimality conditions for a PDEconstrained control problem with probabilistic and almostsure state constraints, Nonsmooth And Variational Analysis (NAVAL) Conference, June 26  28, 2023, Université de Bourgogne, Dijon, France, June 27, 2023.

R. Henrion, Probabilistic constraints in optimal control, SIAM Conference on Optimization (OP23), MS 163 ``Risk Models in Stochastic Optimization'', May 31  June 3, 2023, Seattle, USA, June 1, 2023.

R. Henrion, Turnpike phenomenon in discretetime optimal control with probabilistic constraint, 2nd Vienna Workshop on Computational Optimization, March 15  17, 2023, Universität Wien, Austria, March 15, 2023.

D. Hömberg, R. Henrion, N. Kliche, Modeling and simulation of weakly coupled minigrids under uncertainty, MATH+ Day, HumboldtUniversität zu Berlin, October 20, 2023.

D. Hömberg, ODEconstrained optimal control, preparatory winter school within the project ``Ethiopian Norwegian Network in Computational Mathematics'' (ENNCoMat), November 27  December 1, 2023, Addis Ababa University, Ethiopia.

D. Hömberg, On twoscale topology optimization for AM, The Fourth International Conference on Simulation for Additive Manufacturing (SimAM 2023), IS14 ``Advanced Methods and Innovative Technologies for the Optimal Design of Structures and Materials II'', July 26  28, 2023, Galileo Science Congress Center MunichGarching, Garching, July 27, 2023.

D. Hömberg, Phasefield based topology optimization, Norwegian Workshop on Mathematical Optimization, Nonlinear and Variational Analysis 2023, April 26  28, 2023, Norwegian University of Science and Technology, Trondheim, Norway, April 27, 2023.

D. Hömberg, Twoscale topology optimization  A phase field approach, 22nd European Conference on Mathematics for Industry (ECMI2023), MS17 ``ECMI SIG: Mathematics for the Digital Factory'', June 26  30, 2023, Wrocław University of Science and Technology Congress Centre, Poland, June 26, 2023.

D. Hömberg, Twoscale topology optimization for 3D printing, SIAM Conference on Computational Science and Engineering (CSE23), Minisymposium MS328 ``ECMI: Perspectives and Successes of Mathematical Challenges in Industrial Applications'', February 26  March 3, 2023, Amsterdam, Netherlands, March 2, 2023.

R. Lasarzik, Analysis of an AllenCahn system in two scale topology optimization, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00874 ``Recent Advances in the Analysis and Numerics for PhaseField Models'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 22, 2023.

R. Lasarzik, Energyvariational solutions for conservation laws, Università degli Studi di Pavia, Dipartimento di Matematica, Italy, February 7, 2023.

R. Lasarzik, Energyvariational solutions for conservation laws, CRC Colloquium, Freie Universität Berlin, Department of Mathematics and Computer Science, October 19, 2023.

R. Lasarzik, Energyvariational solutions for different viscoelastic fluid models, Workshop ``Energetic Methods for MultiComponent Reactive Mixtures Modelling, Stability, and Asymptotic Analysis'', September 13  15, 2023, WIAS Berlin, September 15, 2023.

R. Lasarzik, Solvability for viscoelastic materials via the energyvariational approach, DMV Annual Meeting 2023, September 25  28, 2023, Technische Universität Ilmenau, September 25, 2023.

A. Rathsfeld, Analysis of scattering matrix algorithm, 10th International Congress on Industrial and Applied Mathematics (ICIAM 2023), Minisymposium 00297 ``Wave Scattering Problems: Numerical Methods with Applications'', August 20  25, 2023, Waseda University, Tokyo, Japan, August 22, 2023.

A. Rathsfeld, Analysis of scattering matrix algorithm for diffraction by periodic surface structures, Chinese Academy of Sciences, Institute of Computational Mathematics and Scientific/Engineering Computing, Beijing, China, September 4, 2023.

A. Rathsfeld, Planewave scattering by biperiodic gratings and rough surfaces: Radiation condition and farfield model, Nankai University, Department of Scientific and Engineering Computing, Tianjin, China, September 7, 2023.

A. Rathsfeld, Planewave scattering by biperiodic gratings and rough surfaces: Radiation condition and farfield model (online talk), University of Tokyo, Graduate School of Mathematical Sciences, Japan, October 26, 2023.

A. Rathsfeld, Simulation and inverse problems for rough surfaces by numerical methods of periodic grating structures (online talk), University of Tokyo, Graduate School of Mathematical Sciences, Japan, November 29, 2023.
Preprints im Fremdverlag

M. Eigel, J. Schütte, Adaptive multilevel neural networks for parametric PDEs with error estimation, Preprint no. arXiv:2403.12650, , 2024, DOI 10.48550/arXiv.2403.12650 .

P. Trunschke, A. Nouy, M. Eigel, Weighted sparsity and sparse tensor networks for least squares approximation, Preprint no. arXiv:2310.08942, Cornell University, 2023, DOI 10.48550/arXiv.2310.08942 .
Forschungsgruppen
 Partielle Differentialgleichungen
 Laserdynamik
 Numerische Mathematik und Wissenschaftliches Rechnen
 Nichtlineare Optimierung und Inverse Probleme
 Stochastische Systeme mit Wechselwirkung
 Stochastische Algorithmen und Nichtparametrische Statistik
 Thermodynamische Modellierung und Analyse von Phasenübergängen
 Nichtglatte Variationsprobleme und Operatorgleichungen