## Fachbereich Mathematik

### Filtern

#### Erscheinungsjahr

- 1995 (41) (entfernen)

#### Dokumenttyp

- Preprint (23)
- Wissenschaftlicher Artikel (10)
- Bericht (6)
- Dissertation (1)
- Vorlesung (1)

#### Volltext vorhanden

- ja (41) (entfernen)

#### Schlagworte

- Boltzmann Equation (3)
- Numerical Simulation (3)
- Hysteresis (2)
- Boundary Value Problems (1)
- CAQ (1)
- Evolution Equations (1)
- Fatigue (1)
- Hybrid Codes (1)
- Non-linear wavelet thresholding (1)
- Palm distributions (1)

- An improved asymptotic analysis of the expected number of pivot steps required by the simplex algorithm (1995)
- Let \(a_1,\dots,a_m\) be i.i .d. vectors uniform on the unit sphere in \(\mathbb{R}^n\), \(m\ge n\ge3\) and let \(X\):= {\(x \in \mathbb{R}^n \mid a ^T_i x\leq 1\)} be the random polyhedron generated by. Furthermore, for linearly independent vectors \(u\), \(\bar u\) in \(\mathbb{R}^n\), let \(S_{u, \bar u}(X)\) be the number of shadow vertices of \(X\) in \(span (u, \bar u\)). The paper provides an asymptotic expansion of the expectation value \(E (S_{u, \bar u})\) for fixed \(n\) and \(m\to\infty\). The first terms of the expansion are given explicitly. Our investigation of \(E (S_{u, \bar u})\) is closely connected to Borgwardt's probabilistic analysis of the shadow vertex algorithm - a parametric variant of the simplex algorithm. We obtain an improved asymptotic upper bound for the number of pivot steps required by the shadow vertex algorithm for uniformly on the sphere distributed data.

- A Note on Approximation Algorithms for the Multicriteria \(\Delta\)-TSP (1995)
- The Tree and Christofides heuristic are weil known 1- and \(\frac{1} {2}\)- approximate algorithms for the \(\Delta\)-TSP. In this note their performance for the multicriteria case is described, depending on the norm in \(\mathbb{R}^Q\) in case of \(Q\) criteria.

- On Matroids with Multiple Objectives (1995)
- In this paper we investigate two optimization problems for matroids with multiple objective functions, namely finding the pareto set and the max-ordering problem which conists in finding a basis such that the largest objective value is minimal. We prove that the decision versions of both problems are NP-complete. A solution procedure for the max-ordering problem is presented and a result on the relation of the solution sets of the two problems is given. The main results are a characterization of pareto bases by a basis exchange property and finally a connectivity result for proper pareto solutions.

- Lexicographic Max-Ordering - A Solution Concept for Multicriteria Combinatorial Optimization (1995)
- In this paper we will introduce the concept of lexicographic max-ordering solutions for multicriteria combinatorial optimization problems. Section 1 provides the basic notions of multicriteria combinatorial optimization and the definition of lexicographic max-ordering solutions. In Section 2 we will show that lexicographic max-ordering solutions are pareto optimal as well as max-ordering optimal solutions. Furthermore lexicographic max-ordering solutions can be used to characterize the set of pareto solutions. Further properties of lexicographic max-ordering solutions are given. Section 3 will be devoted to algorithms. We give a polynomial time algorithm for the two criteria case where one criterion is a sum and one is a bottleneck objective function, provided that the one criterion sum problem is solvable in polynomial time. For bottleneck functions an algorithm for the general case of Q criteria is presented.

- Connectedness of Efficient Solutions in Multiple Criteria Combinatorial Optimization (1995)
- In multiple criteria optimization an important research topic is the topological structure of the set \( X_e \) of efficient solutions. Of major interest is the connectedness of \( X_e \), since it would allow the determination of \( X_e \) without considering non-efficient solutions in the process. We review general results on the subject,including the connectedness result for efficient solutions in multiple criteria linear programming. This result can be used to derive a definition of connectedness for discrete optimization problems. We present a counterexample to a previously stated result in this area, namely that the set of efficient solutions of the shortest path problem is connected. We will also show that connectedness does not hold for another important problem in discrete multiple criteria optimization: the spanning tree problem.

- An Overview of the Method of Smoothed Particle Hydrodynamics (1995)
- This report is intended to provide an introduction to the method of SmoothedParticle Hydrodynamics or SPH. SPH is a very versatile, fully Lagrangian, particle based code for solving fluid dynamical problems. Many technical aspects of the method are explained which can then be employed to extend the application of SPH to new problems.

- A Model for the Cloudiness of Fabrics (1995)
- Cloudy inhomogenities in artificial fabrics are graded by a fast method which is based on a Laplacian pyramid decomposition of the fabric image. This band-pass representation takes into account the scale character of the cloudiness. A quality measure of the entire cloudiness is obtained as a weighted mean over the variances of all scales.

- Locally Supported Kernels for Spherical Spline Interpolation (1995)
- By the use of locally supported basis functions for spherical spline interpolation the applicability of this approximation method is spread out since the resulting interpolation matrix is sparse and thus efficient solvers can be used. In this paper we study locally supported kernels in detail. Investigations on the Legendre coefficients allow a characterization of the underlying Hilbert space structure. We show now spherical spline interpolation with polynomial precision can be managed with locally supported kernels, thus giving the possibility to combine approximation techniques based on spherical harmonic expansions with those based on locally supported kernels.