## Fachbereich Mathematik

### Refine

#### Year of publication

- 2008 (28) (remove)

#### Document Type

- Doctoral Thesis (15)
- Preprint (8)
- Report (4)
- Study Thesis (1)

#### Keywords

- Level-Set-Methode (2)
- domain decomposition (2)
- mesh generation (2)
- Abgeschlossenheit (1)
- Adjoint system (1)
- Alter (1)
- Annulus (1)
- Automatische Spracherkennung (1)
- Bayes-Entscheidungstheorie (1)
- Behinderter (1)
- Berechnungskomplexität (1)
- Bernstein Kern (1)
- Biot Poroelastizitätgleichung (1)
- CDS (1)
- CPDO (1)
- Center Location (1)
- Circle Location (1)
- Combinatorial Optimization (1)
- Core (1)
- Credit Risk (1)
- Curvature (1)
- Defaultable Options (1)
- Delaunay (1)
- Delaunay triangulation (1)
- Delaunay triangulierung (1)
- Eigenschwingung (1)
- Entscheidungsbaum (1)
- FEM (1)
- Fiber spinning (1)
- Fiber suspension flow (1)
- Filtration (1)
- Finanzmathematik (1)
- First--order optimality system (1)
- Fluid-Struktur-Wechselwirkung (1)
- Gebietszerlegung (1)
- Gebietszerlegungsmethode (1)
- Gittererzeugung (1)
- Gravimetrie (1)
- Harmonische Funktion (1)
- Hub Location Problem (1)
- Hysterese (1)
- Inverses Problem (1)
- Kaktusgraph (1)
- Kopplungsproblem (1)
- Krümmung (1)
- Kugelflächenfunktion (1)
- Level set methods (1)
- Location (1)
- MBS (1)
- MKS (1)
- Markov-Ketten-Monte-Carlo-Verfahren (1)
- Massendichte (1)
- Mathematical Finance (1)
- Mixed integer programming (1)
- Multicriteria optimization (1)
- Multiperiod planning (1)
- Multiskalenapproximation (1)
- Neumann Wavelets (1)
- Neumann wavelets (1)
- Newtonsches Potenzial (1)
- Nichtlineare Approximation (1)
- Niederschlag (1)
- Nonlinear Optimization (1)
- Optimal control (1)
- Orthonormalbasis (1)
- Order of printed copy (1)
- Punktprozess (1)
- Regularisierung (1)
- Semantik (1)
- Shapley value (1)
- Shapleywert (1)
- Signalanalyse (1)
- Sphäre (1)
- Spieltheorie (1)
- Spline (1)
- Standortprobleme (1)
- Stochastic Control (1)
- Stochastische optimale Kontrolle (1)
- Stokes Wavelets (1)
- Stokes wavelets (1)
- Stokes-Gleichung (1)
- Stoßdämpfer (1)
- Systemidentifikation (1)
- Tensorfeld (1)
- Topologieoptimierung (1)
- Topology optimization (1)
- Tropische Geometrie (1)
- Vektorfeld (1)
- Vollständigkeit (1)
- Wellengeschwindigkeit (1)
- Zeitreihe (1)
- Zentrenprobleme (1)
- benders decomposition (1)
- body wave velocity (1)
- cactus graph (1)
- cancer radiation therapy (1)
- change point (1)
- closure approximation (1)
- complexity (1)
- cooperative game (1)
- core (1)
- cuts (1)
- decision support systems (1)
- estimation (1)
- extreme equilibria (1)
- film casting (1)
- filtration (1)
- finite volume method (1)
- fluid structure interaction (1)
- free boundary (1)
- free surface (1)
- freie Oberfläche (1)
- gebietszerlegung (1)
- geometric ergodicity (1)
- gitter (1)
- harmonic density (1)
- harmonische Dichte (1)
- heuristic (1)
- interface problem (1)
- inverse problems (1)
- kooperative Spieltheorie (1)
- level set method (1)
- logical analysis (1)
- logische Analyse (1)
- mathematical modelling (1)
- matrix decomposition (1)
- minimaler Schnittbaum (1)
- minimum cut tree (1)
- monotropic programming (1)
- multiliead collimator sequencing (1)
- multiscale approximation (1)
- network congestion game (1)
- netzgenerierung (1)
- nichtlineare Modellreduktion (1)
- nonlinear model reduction (1)
- nonwovens (1)
- normal mode (1)
- optimal control (1)
- porous media (1)
- poröse Medien (1)
- reproducing kernel (1)
- reproduzierender Kern (1)
- rheology (1)
- schlecht gestellt (1)
- splitting function (1)
- stationarity (1)
- stochastic optimal control (1)
- tension problems (1)
- total latency (1)
- transmission conditions (1)
- well-posedness (1)
- Übergangsbedingungen (1)

This thesis is devoted to the study of tropical curves with emphasis on their enumerative geometry. Major results include a conceptual proof of the fact that the number of rational tropical plane curves interpolating an appropriate number of general points is independent of the choice of points, the computation of intersection products of Psi-classes on the moduli space of rational tropical curves, a computation of the number of tropical elliptic plane curves of given degree and fixed tropical j-invariant as well as a tropical analogue of the Riemann-Roch theorem for algebraic curves. The result are obtained in joint work with Hannah Markwig and/or Andreas Gathmann.

This thesis is devoted to deal with the stochastic optimization problems in various situations with the aid of the Martingale method. Chapter 2 discusses the Martingale method and its applications to the basic optimization problems, which are well addressed in the literature (for example, [15], [23] and [24]). In Chapter 3, we study the problem of maximizing expected utility of real terminal wealth in the presence of an index bond. Chapter 4, which is a modification of the original research paper joint with Korn and Ewald [39], investigates an optimization problem faced by a DC pension fund manager under inflationary risk. Although the problem is addressed in the context of a pension fund, it presents a way of how to deal with the optimization problem, in the case there is a (positive) endowment. In Chapter 5, we turn to a situation where the additional income, other than the income from returns on investment, is gained by supplying labor. Chapter 6 concerns a situation where the market considered is incomplete. A trick of completing an incomplete market is presented there. The general theory which supports the discussion followed is summarized in the first chapter.

We present results and views about a project in assisted living. The scenario is a room in which an elderly and/or disabled person lives who is not able to perform certain actions due to restricted mobility. We enable the person to express commands verbally that will then be executed automatically. There are several severe problems involved that complicate the situation. The person may utter the command in a rather unexpected way, the person makes an error or the action cannot be performed due to several reasons. In our approach we present an architecture with three components: The recognition component that contains novel features in the signal processing, the analysis component that logically analyzes the command, and the execution component that performs the action automatically. All three components communicate with each other.

This thesis covers two important fields in financial mathematics, namely the continuous time portfolio optimisation and credit risk modelling. We analyse optimisation problems of portfolios of Call and Put options on the stock and/or the zero coupon bond issued by a firm with default risk. We use the martingale approach for dynamic optimisation problems. Our findings show that the riskier the option gets, the less proportion of his wealth the investor allocates to the risky asset. Further, we analyse the Credit Default Swap (CDS) market quotes on the Eurobonds issued by Turkish sovereign for building the term structure of the sovereign credit risk. Two methods are introduced and compared for bootstrapping the risk-neutral probabilities of default (PD) in an intensity based (or reduced form) credit risk modelling approach. We compare the market-implied PDs with the actual PDs reported by credit rating agencies based on historical experience. Our results highlight the market price of the sovereign credit risk depending on the assigned rating category in the sampling period. Finally, we find an optimal leverage strategy for delivering the payments promised by a Constant Proportion Debt Obligation (CPDO). The problem is solved via the introduction and explicit solution of a stochastic control problem by transforming the related Hamilton-Jacobi-Bellman Equation into its dual. Contrary to the industry practise, the optimal leverage function we derive is a non-linear function of the CPDO asset value. The simulations show promising behaviour of the optimal leverage function compared with the one popular among practitioners.

The desire to model in ever increasing detail geometrical and physical features has lead to a steady increase in the number of points used in field solvers. While many solvers have been ported to parallel machines, grid generators have left behind. Sequential generation of meshes of large size is extremely problematic both in terms of time and memory requirements. Therefore, the need for developing parallel mesh generation technique is well justified. In this work a novel algorithm is presented for automatic parallel generation of tetrahedral computational meshes based on geometrical domain decomposition. It has a potential to remove this bottleneck. Different domain decomposition approaches and criteria have been investigated. Questions regarding time and memory consumption, efficiency of computations and quality of generated surface and volume meshes have been considered. As a result of the work parTgen (partitioner and parallel tetrahedral mesh generator) software package based on the developed algorithm has been created. Several real-life examples of relatively complex structures involving large meshes (of order 10^7-10^8 elements) are given. It has been shown that high mesh quality is achieved. Memory and time consumption are reduced significantly, and parallel algorithm is efficient.

An optimal control problem for a mathematical model of a melt spinning process is considered. Newtonian and non--Newtonian models are used to describe the rheology of the polymeric material, the fiber is made of. The extrusion velocity of the polymer at the spinneret as well as the velocity and temperature of the quench air serve as control variables. A constrained optimization problem is derived and the first--order optimality system is set up to obtain the adjoint equations. Numerical solutions are carried out using a steepest descent algorithm.

We present an optimal control approach for the isothermal film casting process with free surfaces described by averaged Navier-Stokes equations. We control the thickness of the film at the take-up point using the shape of the nozzle. The control goal consists in finding an even thickness profile. To achieve this goal, we minimize an appropriate cost functional. The resulting minimization problem is solved numerically by a steepest descent method. The gradient of the cost functional is approximated using the adjoint variables of the problem with fixed film width. Numerical simulations show the applicability of the proposed method.

This paper provides a brief overview of two linear inverse problems concerned with the determination of the Earth’s interior: inverse gravimetry and normal mode tomography. Moreover, a vector spline method is proposed for a combined solution of both problems. This method uses localised basis functions, which are based on reproducing kernels, and is related to approaches which have been successfully applied to the inverse gravimetric problem and the seismic traveltime tomography separately.

A modular level set algorithm is developed to study the interface and its movement for free moving boundary problems. The algorithm is divided into three basic modules : initialization, propagation and contouring. Initialization is the process of finding the signed distance function from closed objects. We discuss here, a methodology to find an accurate signed distance function from a closed, simply connected surface discretized by triangulation. We compute the signed distance function using the direct method and it is stored efficiently in the neighborhood of the interface by a narrow band level set method. A novel approach is employed to determine the correct sign of the distance function at convex-concave junctions of the surface. The accuracy and convergence of the method with respect to the surface resolution is studied. It is shown that the efficient organization of surface and narrow band data structures enables the solution of large industrial problems. We also compare the accuracy of the signed distance function by direct approach with Fast Marching Method (FMM). It is found that the direct approach is more accurate than FMM. Contouring is performed through a variant of the marching cube algorithm used for the isosurface construction from volumetric data sets. The algorithm is designed to keep foreground and background information consistent, contrary to the neutrality principle followed for surface rendering in computer graphics. The algorithm ensures that the isosurface triangulation is closed, non-degenerate and non-ambiguous. The constructed triangulation has desirable properties required for the generation of good volume meshes. These volume meshes are used in the boundary element method for the study of linear electrostatics. For estimating surface properties like interface position, normal and curvature accurately from a discrete level set function, a method based on higher order weighted least squares is developed. It is found that least squares approach is more accurate than finite difference approximation. Furthermore, the method of least squares requires a more compact stencil than those of finite difference schemes. The accuracy and convergence of the method depends on the surface resolution and the discrete mesh width. This approach is used in propagation for the study of mean curvature flow and bubble dynamics. The advantage of this approach is that the curvature is not discretized explicitly on the grid and is estimated on the interface. The method of constant velocity extension is employed for the propagation of the interface. With least squares approach, the mean curvature flow has considerable reduction in mass loss compared to finite difference techniques. In the bubble dynamics, the modules are used for the study of a bubble under the influence of surface tension forces to validate Young-Laplace law. It is found that the order of curvature estimation plays a crucial role for calculating accurate pressure difference between inside and outside of the bubble. Further, we study the coalescence of two bubbles under surface tension force. The application of these modules to various industrial problems is discussed.