Search Results
Inverse learning in Hilbert scales
2023, Rastogi, Abhishake, Mathé, Peter
We study linear ill-posed inverse problems with noisy data in the framework of statistical learning. The corresponding linear operator equation is assumed to fit a given Hilbert scale, generated by some unbounded self-adjoint operator. Approximate reconstructions from random noisy data are obtained with general regularization schemes in such a way that these belong to the domain of the generator. The analysis has thus to distinguish two cases, the regular one, when the true solution also belongs to the domain of the generator, and the ‘oversmoothing’ one, when this is not the case. Rates of convergence for the regularized solutions will be expressed in terms of certain distance functions. For solutions with smoothness given in terms of source conditions with respect to the scale generating operator, then the error bounds can then be made explicit in terms of the sample size.
A function space framework for structural total variation regularization with applications in inverse problems
2018, Hintermüller, Michael, Holler, Martin, Papafitsoros, Kostas
In this work, we introduce a function space setting for a wide class of structural/weighted total variation (TV) regularization methods motivated by their applications in inverse problems. In particular, we consider a regularizer that is the appropriate lower semi-continuous envelope (relaxation) of a suitable TV type functional initially defined for sufficiently smooth functions. We study examples where this relaxation can be expressed explicitly, and we also provide refinements for weighted TV for a wide range of weights. Since an integral characterization of the relaxation in function space is, in general, not always available, we show that, for a rather general linear inverse problems setting, instead of the classical Tikhonov regularization problem, one can equivalently solve a saddle-point problem where no a priori knowledge of an explicit formulation of the structural TV functional is needed. In particular, motivated by concrete applications, we deduce corresponding results for linear inverse problems with norm and Poisson log-likelihood data discrepancy terms. Finally, we provide proof-of-concept numerical examples where we solve the saddle-point problem for weighted TV denoising as well as for MR guided PET image reconstruction.
Variable Step Mollifiers and Applications
2020, Hintermüller, Michael, Papafitsoros, Kostas, Rautenberg, Carlos N.
We consider a mollifying operator with variable step that, in contrast to the standard mollification, is able to preserve the boundary values of functions. We prove boundedness of the operator in all basic Lebesgue, Sobolev and BV spaces as well as corresponding approximation results. The results are then applied to extend recently developed theory concerning the density of convex intersections. © 2020, The Author(s).
On the feasibility of using open source solvers for the simulation of a turbulent air flow in a dairy barn
2020, Janke, David, Caiazzo, Alfonso, Ahmed, Naveed, Alia, Najib, Knoth, Oswald, Moreau, Baptiste, Wilbrandt, Ulrich, Willink, Dilya, Amon, Thomas, John, Volker
Two transient open source solvers, OpenFOAM and ParMooN, and the commercial solver Ansys Fluent are assessed with respect to the simulation of the turbulent air flow inside and around a dairy barn. For this purpose, data were obtained in an experimental campaign at a 1:100 scaled wind tunnel model. All solvers used different meshes, discretization schemes, and turbulence models. The experimental data and numerical results agree well for time-averaged stream-wise and vertical-wise velocities. In particular, the air exchange was predicted with high accuracy by both open source solvers with relative differences less than 4% and by the commercial solver with a relative difference of 9% compared to the experimental results. With respect to the turbulent quantities, good agreements at the second (downwind) half of the barn inside and especially outside the barn could be achieved, where all codes accurately predicted the flow separation and, in many cases, the root-mean-square velocities. Deviations between simulations and experimental results regarding turbulent quantities could be observed in the first part of the barn. These deviations can be attributed to the utilization of roughness elements between inlet and barn in the experiment that were not modeled in the numerical simulations. Both open source solvers proved to be promising tools for the accurate prediction of time-dependent phenomena in an agricultural context, e.g., like the transport of particulate matter or pathogen-laden aerosols in and around agricultural buildings. © 2020 The Authors
Reconstruction of Quasi-Local Numerical Effective Models from Low-Resolution Measurements
2020, Caiazzo, A., Maier, R., Peterseim, D.
We consider the inverse problem of reconstructing an effective model for a prototypical diffusion process in strongly heterogeneous media based on coarse measurements. The approach is motivated by quasi-local numerical effective forward models that are provably reliable beyond periodicity assumptions and scale separation. The goal of this work is to show that an identification of the matrix representation related to these effective models is possible. On the one hand, this provides a reasonable surrogate in cases where a direct reconstruction is unfeasible due to a mismatch between the coarse data scale and the microscopic quantities to be reconstructed. On the other hand, the approach allows us to investigate the requirement for a certain non-locality in the context of numerical homogenization. Algorithmic aspects of the inversion procedure and its performance are illustrated in a series of numerical experiments. © 2020, The Author(s).
Drift–diffusion simulation of S-shaped current–voltage relations for organic semiconductor devices
2020, Doan, Duy Hai, Fischer, Axel, Fuhrmann, Jürgen, Glitzky, Annegret, Liero, Matthias
We present an electrothermal drift–diffusion model for organic semiconductor devices with Gauss–Fermi statistics and positive temperature feedback for the charge carrier mobilities. We apply temperature-dependent Ohmic contact boundary conditions for the electrostatic potential and discretize the system by a finite volume based generalized Scharfetter–Gummel scheme. Using path-following techniques, we demonstrate that the model exhibits S-shaped current–voltage curves with regions of negative differential resistance, which were only recently observed experimentally. © 2020, The Author(s).
Numerical upscaling of parametric microstructures in a possibilistic uncertainty framework with tensor trains
2022, Eigel, Martin, Gruhlke, Robert, Moser, Dieter, Grasedyck, Lars
A fuzzy arithmetic framework for the efficient possibilistic propagation of shape uncertainties based on a novel fuzzy edge detection method is introduced. The shape uncertainties stem from a blurred image that encodes the distribution of two phases in a composite material. The proposed framework employs computational homogenisation to upscale the shape uncertainty to a effective material with fuzzy material properties. For this, many samples of a linear elasticity problem have to be computed, which is significantly sped up by a highly accurate low-rank tensor surrogate. To ensure the continuity of the underlying mapping from shape parametrisation to the upscaled material behaviour, a diffeomorphism is constructed by generating an appropriate family of meshes via transformation of a reference mesh. The shape uncertainty is then propagated to measure the distance of the upscaled material to the isotropic and orthotropic material class. Finally, the fuzzy effective material is used to compute bounds for the average displacement of a non-homogenized material with uncertain star-shaped inclusion shapes.
First-Order Methods for Convex Optimization
2021, Dvurechensky, Pavel, Shtern, Shimrit, Staudigl, Mathias
First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various applications, including most importantly machine learning, signal processing, imaging and control theory. First-order methods have the potential to provide low accuracy solutions at low computational complexity which makes them an attractive set of tools in large-scale optimization problems. In this survey, we cover a number of key developments in gradient-based optimization methods. This includes non-Euclidean extensions of the classical proximal gradient method, and its accelerated versions. Additionally we survey recent developments within the class of projection-free methods, and proximal versions of primal-dual schemes. We give complete proofs for various key results, and highlight the unifying aspects of several optimization algorithms.
High order discretization methods for spatial-dependent epidemic models
2022, Takács, Bálint, Hadjimichael, Yiannis
In this paper, an epidemic model with spatial dependence is studied and results regarding its stability and numerical approximation are presented. We consider a generalization of the original Kermack and McKendrick model in which the size of the populations differs in space. The use of local spatial dependence yields a system of partial-differential equations with integral terms. The uniqueness and qualitative properties of the continuous model are analyzed. Furthermore, different spatial and temporal discretizations are employed, and step-size restrictions for the discrete model’s positivity, monotonicity preservation, and population conservation are investigated. We provide sufficient conditions under which high-order numerical schemes preserve the stability of the computational process and provide sufficiently accurate numerical approximations. Computational experiments verify the convergence and accuracy of the numerical methods.
On the convergence order of the finite element error in the kinetic energy for high Reynolds number incompressible flows
2021, GarcÃa-Archilla, Bosco, John, Volker, Novo, Julia
The kinetic energy of a flow is proportional to the square of the norm of the velocity. Given a sufficient regular velocity field and a velocity finite element space with polynomials of degree , then the best approximation error in is of order . In this survey, the available finite element error analysis for the velocity error in is reviewed, where is a final time. Since in practice the case of small viscosity coefficients or dominant convection is of particular interest, which may result in turbulent flows, robust error estimates are considered, i.e., estimates where the constant in the error bound does not depend on inverse powers of the viscosity coefficient. Methods for which robust estimates can be derived enable stable flow simulations for small viscosity coefficients on comparatively coarse grids, which is often the situation encountered in practice. To introduce stabilization techniques for the convection-dominated regime and tools used in the error analysis, evolutionary linear convection–diffusion equations are studied at the beginning. The main part of this survey considers robust finite element methods for the incompressible Navier–Stokes equations of order , , and for the velocity error in . All these methods are discussed in detail. In particular, a sketch of the proof for the error bound is given that explains the estimate of important terms which determine finally the order of convergence. Among them, there are methods for inf–sup stable pairs of finite element spaces as well as for pressure-stabilized discretizations. Numerical studies support the analytic results for several of these methods. In addition, methods are surveyed that behave in a robust way but for which only a non-robust error analysis is available. The conclusion of this survey is that the problem of whether or not there is a robust method with optimal convergence order for the kinetic energy is still open.