Christine Bürli (Universität Basel)
Mathematical modelling of transmission dynamics of Opisthorchis viverrini
10:00 • Universität Basel, Kollegienhaus, Petersplatz 1, Basel, Hörsaal 120
Prof. Dr. Erik Burman (University College London)
Ill-posed problems and stabilized Finite Element Methods abstract
Abstract:
In this talk we will consider some ill-posed elliptic equations and their discretization using Finite Element Methods. The standard approach to ill-posed problems is to regularize the continuous problem so that existence and uniqueness is guaranteed. The regularized problem can then be solved using standard Finite Element Methods. When using this strategy, in order to optimize accuracy, the regularization parameter must be chosen as a function both of the stability properties of the ill-posed problem, the mesh parameter and perturbations in data. Here we will propose a different approach [1], where the ill-posed pde is discretized in an optimization framework, prior to regularization. To ensure discrete well-posedness we add stabilizing terms to the formulation, drawing on experience from stabilized FEM and discontinuous Galerkin methods. The error in the resulting Finite Element reconstructions is then analyzed using Carleman estimates on the continuous problem. This results in approximations that are optimal with respect to the approximation order of the Finite Element space and the stability of the computed quantity. The mesh parameter here plays the role of the regularization parameter. Mesh resolution can be chosen independently of the stability properties of the physical problem, but must match perturbations in data, in a way made explicit in the estimates. Some examples of problems analyzed in this framework will be presented, selectedfrom recent work on the Helmholtz equation [4], the convection diffusion equation [5], Stokes\'equations [2] and Darcy\'s equation [3].
Keywords: ill-posed problems, data assimilation, stabilized Finite Element Methods
Mathematics Subject Classifications (2010): 65N30, 35R25, 65N20.
[1] E. Burman. Stabilised Finite Element Methods for ill-posed problems with conditional stability. Building bridges: connections and challenges in modern approaches to numerical partial differential equations, 93127,Lect. Notes Comput. Sci. Eng., 114, Springer, [Cham], 2016., Dec. 2015.
[2] E. Burman, P. Hansbo, Stabilized nonconforming Finite Element Methods for data assimilation in incompressible flows. Math. Comp. 87, no. 311, 2018.
[3] E. Burman, M. G. Larson, L. Oksanen. Primal dual mixed Finite Element Methods for the elliptic Cauchy problem, arXiv:1712.10172, Siam J. Num. Anal., to appear, 2018.
[4] E. Burman, M. Nechita, L. Oksanen. Unique continuation for the Helmholtz equation using stabilized Finite Element Methods. Journal de Mathematiques Pures et Appliquees,https://doi.org/10.1016/j.matpur.2018.10.003.
[5] E. Burman, M. Nechita, L. Oksanen. A stabilized Finite Element Method for inverse problems subject to the convection-diffusion equation. I: diffusion-dominated regime. arXiv:1811.00431, 2018.
16:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2
Elena Grigorescu (Purdue University)
Relaxed Locally Correctable Codes in Computationally Bounded Channels abstract
Abstract:
Locally correctable codes for the Hamming channel exhibit dramatic tradeoffs between their information rate and the locality of the correcting algorithm. We construct "relaxed" versions of locally correctable codes, for computationally bounded, yet adversarial channels, under the assumption that collision-resistant hash functions exist. Specifically, we build codes over the binary alphabet, with constant information rate and poly-logarithmic locality. Our constructions compare favorably with existing schemes built under much stronger cryptographic assumptions, and with their classical analogues in the computationally unbounded, Hamming channel. Our constructions crucially employ collision-resistant hash functions and local expander graphs, extending ideas from recent cryptographic constructions of memory-hard functions.
16:15 • EPF Lausanne, Salle BC229