## Fachbereich Mathematik

### Refine

#### Year of publication

- 2000 (44) (remove)

#### Document Type

- Preprint (35)
- Lecture (5)
- Article (2)
- Diploma Thesis (1)
- Study Thesis (1)

#### Keywords

- Logik (2)
- Algebraic Geometry (1)
- Black-Scholes model (1)
- CFL type conditions (1)
- Capital-at-Risk (1)
- Convex Analysis (1)
- Fokker-Planck equation (1)
- Geometrical algorithms (1)
- Grad expansion (1)
- Gravimetry (1)

- Bestimmung von Spannungsgradienten aus diskreten Finite-Element-Daten (2000)
- Wir beschreiben eine Methode zur Approximation von Spannungsgradienten aus diskreten Spannungsdaten. Eine herkömmliche Diskretisierung der Ableitungen aus Funktionswerten führt zu Stabilitätsproblemen, weswegen eine Möglichkeit zur Kontrolle der Ableitungen notwendig ist (Regularisierung). Wir bestimmen zunächst das Funktional der potentiellen Energie und führen zusätzlich ein Fehlerfunktional ein, das die Anpassung an die vorgegebenen diskreten Werte ermöglicht. Durch Gewichtung der beiden Funktionale und Minimierung des Gesamtfunktionals erhält man den gewünschten Ausgleich zwischen der Fehlerkontrolle beim Ableiten einerseits und Kontrolle der Fehler bei den Randwerten andererseits.

- On the Connectedness of Efficient Solutions in Combinatorial Optimization Problems and Ordered Graphs - Matching and Partial Orders - (2000)
- In multicriteria optimization problems the connectedness of the set of efficient solutions (pareto set) is of special interest since it would allow the determination of the efficient solutions without considering non-efficient solutions in the process. In the case of the multicriteria problem to minimize matchings the set of efficient solutions is not connected. The set of minimal solutions E pot with respect to the power ordered set contains the pareto set. In this work theorems about connectedness of E pot are given. These lead to an automated process to detect all efficient solutions.

- Linear Facility Location in Three Dimensions - Models and Solution Methods (2000)
- We consider the problem of locating a line or a line segment in three- dimensional space, such that the sum of distances from the linear facility to a given set of points is minimized. An example is planning the drilling of a mine shaft, with access to ore deposits through horizontal tunnels connecting the deposits and the shaft. Various models of the problem are developed and analyzed, and effcient solution methods are given.

- Some Complexity Results for k-Cardinality Minimum Cut Problems (2000)
- Many polynomially solvable combinatorial optimization problems (COP) become NP when we require solutions to satisfy an additional cardinality constraint. This family of problems has been considered only recently. We study a newproblem of this family: the k-cardinality minimum cut problem. Given an undirected edge-weighted graph the k-cardinality minimum cut problem is to find a partition of the vertex set V in two sets V 1 , V 2 such that the number of the edges between V 1 and V 2 is exactly k and the sum of the weights of these edges is minimal. A variant of this problem is the k-cardinality minimum s-t cut problem where s and t are fixed vertices and we have the additional request that s belongs to V 1 and t belongs to V 2 . We also consider other variants where the number of edges of the cut is constrained to be either less or greater than k. For all these problems we show complexity results in the most significant graph classes.

- On the minimal energy state of a mixture of charged classical and quantum fluids (2000)
- The paper concerns the equilibrium state of ultra small semiconductor devices. Due to the quantum drift diffusion model, electrons and holes behave as a mixture of charged quantum fluids. Typically the involved scaled Plancks constants of holes, \(\xi\), is significantly smaller than the scaled Plancks constant of electrons. By setting formally \(\xi=0\) a well-posed differential-algebraic system arises. Existence and uniqueness of an equilibrium solution is proved. A rigorous asymptotic analysis shows that this equilibrium solution is the limit (in a rather strong sense) of quantum systems as \(\xi \to 0\). In particular the ground state energies of the quantum systems converge to the ground state energy of the differential-algebraic system as \(\xi \to 0\).

- On singular limits of mean-field equations (2000)
- Mean field equations arise as steady state versions of convection-diffusion systems where the convective field is determined as solution of a Poisson equation whose right hand side is affine in the solutions of the convection-diffusion equations. In this paper we consider the repulsive coupling case for a system of 2 convection-diffusion equations. For general diffusivities we prove the existence of a unique solution of the mean field equation by a variational technique. Also we analyse the small-Debye-length limit and prove convergence to either the so-called charge-neutral case or to a double obstacle problem for the limiting potential depending on the data.

- On the approximation of kinetic equations by moment systems (2000)
- The aim of this article is to show that moment approximations of kinetic equations based on a Maximum Entropy approach can suffer from severe drawbacks if the kinetic velocity space is unbounded. As example, we study the Fokker Planck equation where explicit expressions for the moments of solutions to Riemann problems can be derived. The quality of the closure relation obtained from the Maximum Entropy approach as well as the Hermite/Grad approach is studied in the case of five moments. It turns out that the Maximum Entropy closure is even singular in equilibrium states while the Hermite/Grad closure behaves reasonably. In particular, the admissible moments may lead to arbitrary large speeds of propagation, even for initial data arbitrary close to global eqilibrium.

- Performance of some preconditioners for the p - and hp -version of the finite element method in 3D (2000)

- The Balance Space Approach to Multicriteria Decision Making - Involving the Decision Maker (2000)
- The balance space approach (introduced by Galperin in 1990) provides a new view on multicriteria optimization. Looking at deviations from global optimality of the different objectives, balance points and balance numbers are defined when either different or equal deviations for each objective are allowed. Apportioned balance numbers allow the specification of proportions among the deviations. Through this concept the decision maker can be involved in the decision process. In this paper we prove that the apportioned balance number can be formulated by a min-max operator. Furthermore we prove some relations between apportioned balance numbers and the balance set, and see the representation of balance numbers in the balance set. The main results are necessary and sufficient conditions for the balance set to be exhaustive, which means that by multiplying a vector of weights (proportions of deviation) with its corresponding apportioned balance number a balance point is attained. The results are used to formulate an interactive procedure for multicriteria optimization. All results are illustrated by examples.

- An Annotated Bibliography of Multiobjective Combinatorial Optimization (2000)
- This paper provides an annotated bibliography of multiple objective combinatorial optimization, MOCO. We present a general formulation of MOCO problems, describe the main characteristics of MOCO problems, and review the main properties and theoretical results for these problems. One section is devoted to a brief description of the available solution methodology, both exact and heuristic. The main part of the paper is devoted to an annotation of the existing literature in the field organized problem by problem. We conclude the paper by stating open questions and areas of future research. The list of references comprises more than 350 entries.