## Fachbereich Mathematik

### Refine

#### Year of publication

- 1996 (30) (remove)

#### Document Type

- Preprint (27)
- Article (1)
- Doctoral Thesis (1)
- Master's Thesis (1)

#### Keywords

- Boltzmann Equation (1)
- Cantor sets (1)
- Collision Operator (1)
- Evolutionary Integral Equations (1)
- Gröbner bases (1)
- Hamiltonian (1)
- K-cardinality trees (1)
- Kinetic Theory of Gases (1)
- Lagrange (1)
- Lavrentiev regularization (1)

- Adaptive Load Balance Techniques in Parallel Rarefied Gas Simulations (1996)
- The paper presents some adaptive load balance techniques for the simulation of rarefied gas flows on parallel computers. It is shown that a static load balance is insufficient to obtain a scalable parallel efficiency. Hence, two adaptive techniques are investigated which are based on simple algorithms. Numerical results show that using heuristic techniques one can achieve a sufficiently high efficiency over a wide range of different hardware platforms.

- Moduli spaces of decomposable morhpisms of sheaves and quotients by non-reductive groups (1996)
- We extend the methods of geometric invariant theory to actions of non reductive groups in the case of homomorphisms between decomposable sheaves whose automorphism groups are non recutive. Given a linearization of the natural actionof the group Aut(E)xAut(F) on Hom(E,F), a homomorphism iscalled stable if its orbit with respect to the unipotentradical is contained in the stable locus with respect to thenatural reductive subgroup of the automorphism group. Weencounter effective numerical conditions for a linearizationsuch that the corresponding open set of semi-stable homomorphismsadmits a good and projective quotient in the sense of geometricinvariant theory, and that this quotient is in additiona geometric quotient on the set of stable homomorphisms.

- Heuristics for the K-Cardinality Tree and Subgraph Problems (1996)
- In this paper we consider the problem of finding in a given graph a minimal weight subtree of connected subgraph, which has a given number of edges. These NP-hard combinatorial optimization problems have various applications in the oil industry, in facility layout and graph partitioning. We will present different heuristic approaches based on spanning tree and shortest path methods and on an exact algorithm solving the problem in polynomial time if the underlying graph is a tree. Both the edge- and node weighted case are investigated and extensive numerical results on the behaviour of the heuristics compared to optimal solutions are presented. The best heuristic yielded results within an error margin of less than one percent from optimality for most cases. In a large percentage of tests even optimal solutions have been found.

- An Adaptive Hierarchical Approximation Method on the Sphere Using Axisymmetric Locally Supported Basis Functions (1996)
- The paper discusses the approximation of scattered data on the sphere which is one of the major tasks in geomathematics. Starting from the discretization of singular integrals on the sphere the authors devise a simple approximation method that employs locally supported spherical polynomials and does not require equidistributed grids. It is the basis for a hierarchical approximation algorithm using differently scaled basis functions, adaptivity and error control. The method is applied to two examples one of which is a digital terrain model of Australia.

- Deformation Analysis Using Navier Spline Interpolation (1996)
- The static deformation of the surface of the earth caused by surface pressure like the water load of an ocean or an artificial lake is discussed. First a brief mention is made on the solution of the Boussenesq problem for an infinite halfspace with the elastic medium to be assumed as homogeneous and isotropic. Then the elastic response for realistic earth models is determinied by spline interpolation using Navier splines. Major emphasis is on the derteminination of the elastic field caused by water loads from surface tractions on the (real) earth" s surface. Finally the elastic deflection of an artificial lake assuming a homogeneous isotropic crust is compared for both evaluation methods.

- Gradiometry - an Inverse Problem in Modern Satellite Geodesy (1996)
- Satellite gradiometry and its instrumentation is an ultra-sensitive detection technique of the space gravitational gradient (i.e. the Hesse tensor of the gravitational potential). Gradeometry will be of great significance in inertial navigation, gravity survey, geodynamics and earthquake prediction research. In this paper, satellite gradiometry formulated as an inverse problem of satellite geodesy is discussed from two mathematical aspects: Firstly, satellite gradiometry is considered as a continuous problem of harmonic downward continuation. The space-borne gravity gradients are assumed to be known continuously over the satellite (orbit) surface. Our purpose is to specify sufficient conditions under which uniqueness and existence can be guaranteed. It is shown that, in a spherical context, uniqueness results are obtainable by decomposition of the Hesse matrix in terms of tensor spherical harmonics. In particular, the gravitational potential is proved to be uniquely determined if second order radial derivatives are prescribed at satellite height. This information leads us to a reformulation of satellite gradiometry as a (Fredholm) pseudodifferential equation of first kind. Secondly, for a numerical realization, we assume the gravitational gradients to be known for a finite number of discrete points. The discrete problem is dealt with classical regularization methods, based on filtering techniques by means of spherical wavelets. A spherical singular integral-like approach to regularization methods is established, regularization wavelets are developed which allow the regularization in form of a multiresolution analysis. Moreover, a combined spherical harmonic and spherical regularization wavelet solution is derived as an appropriate tool in future (global and local) high-presision resolution of the earth" s gravitational potential.

- Orthogonal and non-orthogonal multiresolution analysis, scale discrete and exact fully discrete wavelet transform on the sphere (1996)
- Based on a new definition of delation a scale discrete version of spherical multiresolution is described, starting from a scale discrete wavelet transform on the sphere. Depending on the type of application, different families of wavelets are chosen. In particular, spherical Shannon wavelets are constructed that form an orthogonal multiresolution analysis. Finally fully discrete wavelet approximation is discussed in case of band-limited wavelets.

- Spherical Wavelet Transform and its Discretization (1996)
- A continuous version of spherical multiresolution is described, starting from continuous wavelet transform on the sphere. Scale discretization enables us to construct spherical counterparts to Daubechies wavelets and wavelet packets (known from Euclidean theory). Essential tool is the theory of singular integrals on the sphere. It is shown that singular integral operators forming a semigroup of contraction operators of class (Co) (like Abel-Poisson or Gauß-Weierstraß operators) lead in canonical way to (pyramidal) algorithms.