## Fachbereich Mathematik

### Filtern

#### Fachbereich / Organisatorische Einheit

- Fachbereich Mathematik (920)
- Fraunhofer (ITWM) (2)

#### Erscheinungsjahr

#### Dokumenttyp

- Preprint (550)
- Dissertation (203)
- Bericht (106)
- Wissenschaftlicher Artikel (25)
- Diplomarbeit (20)
- Vorlesung (7)
- Arbeitspapier (4)
- Studienarbeit (2)
- Bachelorarbeit (1)
- Masterarbeit (1)

#### Sprache

- Englisch (920) (entfernen)

#### Schlagworte

- Wavelet (12)
- Inverses Problem (10)
- Mehrskalenanalyse (8)
- Boltzmann Equation (7)
- Location Theory (7)
- Approximation (6)
- Navier-Stokes-Gleichung (6)
- Elastoplastizität (5)
- Numerical Simulation (5)
- Algebraische Geometrie (4)

- On the Characters of the Syolw \(2\)-Subgroup of \(F_4(2^n)\) and Decomposition Numbers (2018)
- In this thesis, we deal with the finite group of Lie type \(F_4(2^n)\). The aim is to find information on the \(l\)-decomposition numbers of \(F_4(2^n)\) on unipotent blocks for \(l\neq2\) and \(n\in \mathbb{N}\) arbitrary and on the irreducible characters of the Sylow \(2\)-subgroup of \(F_4(2^n)\). S. M. Goodwin, T. Le, K. Magaard and A. Paolini have found a parametrization of the irreducible characters of the unipotent subgroup \(U\) of \(F_4(q)\), a Sylow \(2\)-subgroup of \(F_4(q)\), of \(F_4(p^n)\), \(p\) a prime, for the case \(p\neq2\). We managed to adapt their methods for the parametrization of the irreducible characters of the Sylow \(2\)-subgroup for the case \(p=2\) for the group \(F_4(q)\), \(q=p^n\). This gives a nearly complete parametrization of the irreducible characters of the unipotent subgroup \(U\) of \(F_4(q)\), namely of all irreducible characters of \(U\) arising from so-called abelian cores. The general strategy we have applied to obtain information about the \(l\)-decomposition numbers on unipotent blocks is to induce characters of the unipotent subgroup \(U\) of \(F_4(q)\) and Harish-Chandra induce projective characters of proper Levi subgroups of \(F_4(q)\) to obtain projective characters of \(F_4(q)\). Via Brauer reciprocity, the multiplicities of the ordinary irreducible unipotent characters in these projective characters give us information on the \(l\)-decomposition numbers of the unipotent characters of \(F_4(q)\). Sadly, the projective characters of \(F_4(q)\) we obtained were not sufficient to give the shape of the entire decomposition matrix.

- An Iterative Plug-in Algorithm for Optimal Bandwidth Selection in Kernel Intensity Estimation for Spatial Data (2018)
- A popular model for the locations of fibres or grains in composite materials is the inhomogeneous Poisson process in dimension 3. Its local intensity function may be estimated non-parametrically by local smoothing, e.g. by kernel estimates. They crucially depend on the choice of bandwidths as tuning parameters controlling the smoothness of the resulting function estimate. In this thesis, we propose a fast algorithm for learning suitable global and local bandwidths from the data. It is well-known, that intensity estimation is closely related to probability density estimation. As a by-product of our study, we show that the difference is asymptotically negligible regarding the choice of good bandwidths, and, hence, we focus on density estimation. There are quite a number of data-driven bandwidth selection methods for kernel density estimates. cross-validation is a popular one and frequently proposed to estimate the optimal bandwidth. However, if the sample size is very large, it becomes computational expensive. In material science, in particular, it is very common to have several thousand up to several million points. Another type of bandwidth selection is a solve-the-equation plug-in approach which involves replacing the unknown quantities in the asymptotically optimal bandwidth formula by their estimates. In this thesis, we develop such an iterative fast plug-in algorithm for estimating the optimal global and local bandwidth for density and intensity estimation with a focus on 2- and 3-dimensional data. It is based on a detailed asymptotics of the estimators of the intensity function and of its second derivatives and integrals of second derivatives which appear in the formulae for asymptotically optimal bandwidths. These asymptotics are utilised to determine the exact number of iteration steps and some tuning parameters. For both global and local case, fewer than 10 iterations suffice. Simulation studies show that the estimated intensity by local bandwidth can better indicate the variation of local intensity than that by global bandwidth. Finally, the algorithm is applied to two real data sets from test bodies of fibre-reinforced high-performance concrete, clearly showing some inhomogeneity of the fibre intensity.

- Application of the Heath-Platen Estimator in Pricing Barrier and Bond Options (2018)
- In this thesis, we focus on the application of the Heath-Platen (HP) estimator in option pricing. In particular, we extend the approach of the HP estimator for pricing path dependent options under the Heston model. The theoretical background of the estimator was first introduced by Heath and Platen [32]. The HP estimator was originally interpreted as a control variate technique and an application for European vanilla options was presented in [32]. For European vanilla options, the HP estimator provided a considerable amount of variance reduction. Thus, applying the technique for path dependent options under the Heston model is the main contribution of this thesis. The first part of the thesis deals with the implementation of the HP estimator for pricing one-sided knockout barrier options. The main difficulty for the implementation of the HP estimator is located in the determination of the first hitting time of the barrier. To test the efficiency of the HP estimator we conduct numerical tests with regard to various aspects. We provide a comparison among the crude Monte Carlo estimation, the crude control variate technique and the HP estimator for all types of barrier options. Furthermore, we present the numerical results for at the money, in the money and out of the money barrier options. As numerical results imply, the HP estimator performs superior among others for pricing one-sided knockout barrier options under the Heston model. Another contribution of this thesis is the application of the HP estimator in pricing bond options under the Cox-Ingersoll-Ross (CIR) model and the Fong-Vasicek (FV) model. As suggested in the original paper of Heath and Platen [32], the HP estimator has a wide range of applicability for derivative pricing. Therefore, transferring the structure of the HP estimator for pricing bond options is a promising contribution. As the approximating Vasicek process does not seem to be as good as the deterministic volatility process in the Heston setting, the performance of the HP estimator in the CIR model is only relatively good. However, for the FV model the variance reduction provided by the HP estimator is again considerable. Finally, the numerical result concerning the weak convergence rate of the HP estimator for pricing European vanilla options in the Heston model is presented. As supported by numerical analysis, the HP estimator has weak convergence of order almost 1.

- Multifacility Location Problems with Tree Structure and Finite Dominating Sets (2018)
- Multifacility location problems arise in many real world applications. Often, the facilities can only be placed in feasible regions such as development or industrial areas. In this paper we show the existence of a finite dominating set (FDS) for the planar multifacility location problem with polyhedral gauges as distance functions, and polyhedral feasible regions, if the interacting facilities form a tree. As application we show how to solve the planar 2-hub location problem in polynomial time. This approach will yield an ε-approximation for the euclidean norm case polynomial in the input data and 1/ε.

- A local time stepping method for district heating networks (2018)
- In this article a new numerical solver for simulations of district heating networks is presented. The numerical method applies the local time stepping introduced in [11] to networks of linear advection equations. In combination with the high order approach of [4] an accurate and very efficient scheme is developed. In several numerical test cases the advantages for simulations of district heating networks are shown.

- On Changepoint Detection in a Series of Stimulus-Response Data (2018)
- In this paper, we demonstrate the power of functional data models for a statistical analysis of stimulus-response experiments which is a quite natural way to look at this kind of data and which makes use of the full information available. In particular, we focus on the detection of a change in the mean of the response in a series of stimulus-response curves where we also take into account dependence in time.

- Local stationarity for spatial data (2017)
- Following the ideas presented in Dahlhaus (2000) and Dahlhaus and Sahm (2000) for time series, we build a Whittle-type approximation of the Gaussian likelihood for locally stationary random fields. To achieve this goal, we extend a Szegö-type formula, for the multidimensional and local stationary case and secondly we derived a set of matrix approximations using elements of the spectral theory of stochastic processes. The minimization of the Whittle likelihood leads to the so-called Whittle estimator \(\widehat{\theta}_{T}\). For the sake of simplicity we assume known mean (without loss of generality zero mean), and hence \(\widehat{\theta}_{T}\) estimates the parameter vector of the covariance matrix \(\Sigma_{\theta}\). We investigate the asymptotic properties of the Whittle estimate, in particular uniform convergence of the likelihoods, and consistency and Gaussianity of the estimator. A main point is a detailed analysis of the asymptotic bias which is considerably more difficult for random fields than for time series. Furthemore, we prove in case of model misspecification that the minimum of our Whittle likelihood still converges, where the limit is the minimum of the Kullback-Leibler information divergence. Finally, we evaluate the performance of the Whittle estimator through computational simulations and estimation of conditional autoregressive models, and a real data application.

- Two instances of duality in commutative algebra (2017)
- In this thesis we address two instances of duality in commutative algebra. In the first part, we consider value semigroups of non irreducible singular algebraic curves and their fractional ideals. These are submonoids of Z^n closed under minima, with a conductor and which fulfill special compatibility properties on their elements. Subsets of Z^n fulfilling these three conditions are known in the literature as good semigroups and their ideals, and their class strictly contains the class of value semigroup ideals. We examine good semigroups both independently and in relation with their algebraic counterpart. In the combinatoric setting, we define the concept of good system of generators, and we show that minimal good systems of generators are unique. In relation with the algebra side, we give an intrinsic definition of canonical semigroup ideals, which yields a duality on good semigroup ideals. We prove that this semigroup duality is compatible with the Cohen-Macaulay duality under taking values. Finally, using the duality on good semigroup ideals, we show a symmetry of the Poincaré series of good semigroups with special properties. In the second part, we treat Macaulay’s inverse system, a one-to-one correspondence which is a particular case of Matlis duality and an effective method to construct Artinian k-algebras with chosen socle type. Recently, Elias and Rossi gave the structure of the inverse system of positive dimensional Gorenstein k-algebras. We extend their result by establishing a one-to-one correspondence between positive dimensional level k-algebras and certain submodules of the divided power ring. We give several examples to illustrate our result.

- Having a Plan B for Robust Optimization (2017)
- We continue in this paper the study of k-adaptable robust solutions for combinatorial optimization problems with bounded uncertainty sets. In this concept not a single solution needs to be chosen to hedge against the uncertainty. Instead one is allowed to choose a set of k different solutions from which one can be chosen after the uncertain scenario has been revealed. We first show how the problem can be decomposed into polynomially many subproblems if k is fixed. In the remaining part of the paper we consider the special case where k=2, i.e., one is allowed to choose two different solutions to hedge against the uncertainty. We decompose this problem into so called coordination problems. The study of these coordination problems turns out to be interesting on its own. We prove positive results for the unconstrained combinatorial optimization problem, the matroid maximization problem, the selection problem, and the shortest path problem on series parallel graphs. The shortest path problem on general graphs turns out to be NP-complete. Further, we present for minimization problems how to transform approximation algorithms for the coordination problem to approximation algorithms for the original problem. We study the knapsack problem to show that this relation does not hold for maximization problems in general. We present a PTAS for the corresponding coordination problem and prove that the 2-adaptable knapsack problem is not at all approximable.

- Duty Rostering for Physicians at a Department of Orthopedics and Trauma Surgery (2017)
- This paper presents a case study of duty rostering for physicians at a department of orthopedics and trauma surgery. We provide a detailed description of the rostering problem faced and present an integer programming model that has been used in practice for creating duty rosters at the department for more than a year. Using real world data, we compare the model output to a manually generated roster as used previously by the department and analyze the quality of the rosters generated by the model over a longer time span. Moreover, we demonstrate how unforeseen events such as absences of scheduled physicians are handled.