## Fachbereich Mathematik

### Refine

#### Year of publication

- 2003 (17) (remove)

#### Document Type

- Preprint (17) (remove)

#### Has Fulltext

- yes (17) (remove)

#### Keywords

- Up Functions (2)
- Abel integral equations (1)
- Approximation (1)
- Bessel functions (1)
- Decomposition and Reconstruction Schemes (1)
- Dynamic cut (1)
- Earliest arrival augmenting path (1)
- Euler's equation of motion (1)
- Glättung (1)
- Glättungsparameterwahl (1)
- Gravitationsfeld (1)
- Harmonische Spline-Funktion (1)
- Hochschild homology (1)
- Hochschild-Homologie (1)
- Homologietheorie (1)
- Inverse problems in Banach spaces (1)
- Inverses Problem (1)
- L-curve Methode (1)
- Label correcting algorithm (1)
- Label setting algorithm (1)
- Lavrentiev regularization for equations with monotone operators (1)
- Locally Supported Radial Basis Functions (1)
- Mehrkriterielle Optimierung (1)
- Mehrskalenanalyse (1)
- Multiple criteria analysis (1)
- Multiresolution Analysis (1)
- Multisresolution Analysis (1)
- Network flows (1)
- Quasi-identities (1)
- Reflection (1)
- Spherical (1)
- Spherical Wavelets (1)
- Stratifaltigkeiten (1)
- Wavelet (1)
- Zyklische Homologie (1)
- associated Legendre functions (1)
- conditional quantiles (1)
- consecutive ones property (1)
- cyclic homology (1)
- elasticity problem (1)
- hyper-quasi-identities (1)
- hypergeometric functions (1)
- hyperquasivarieties (1)
- incident wave (1)
- kernel estimate (1)
- non-commutative geometry (1)
- parameter choice (1)
- quantile autoregression (1)
- quasi-P (1)
- quasi-SH (1)
- quasi-SV (1)
- quasivarieties (1)
- refraction (1)
- set covering (1)
- singular spaces (1)
- singuläre Räume (1)
- stop location (1)
- time series (1)
- triclinic medium (1)
- uniform consistency (1)
- value-at-risk (1)

In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecutive ones structure to develop bounds and a branching scheme. Our approach has been tested on real-world data as well as on theoretical problem instances.

We study a possiblity to use the structure of the regularization error for a posteriori choice of the regularization parameter. As a result, a rather general form of a selection criterion is proposed, and its relation to the heuristical quasi-optimality principle of Tikhonov and Glasko (1964), and to an adaptation scheme proposed in a statistical context by Lepskii (1990), is discussed. The advantages of the proposed criterion are illustrated by using such examples as self-regularization of the trapezoidal rule for noisy Abel-type integral equations, Lavrentiev regularization for non-linear ill-posed problems and an inverse problem of the two-dimensional profile reconstruction.

In recent years a considerable attention was paid to an investigation of finite orders relative to different properties of their isotone functions [2,3]. Strict order relations are defined as strict asymmetric and transitive binary relations. Some algebraic properties of strict orders were already studied in [6]. For the class K of so-called 2-series strict orders we describe the partially ordered set EndK of endomorphism monoids, ordered by inclusion. It is obtained that EndK possesses a least element and in most cases defines a Boolean algebra. Moreover, every 2-series strict order is determined by its n-ary isotone functions for some natural number n.

SST (satellite-to-satellite tracking) and SGG (satellite gravity gradiometry) provide data that allows the determination of the first and second order radial derivative of the earth's gravitational potential on the satellite orbit, respectively. The modeling of the gravitational potential from such data is an exponentially ill-posed problem that demands regularization. In this paper, we present the numerical studies of an approach, investigated in [24] and [25], that reconstructs the potential with spline smoothing. In this case, spline smoothing is not just an approximation procedure but it solves the underlying compact operator equation of the SST-problem and the SGG-problem. The numerical studies in this paper are performed for a simplified geometrical scenario with simulated data, but the approach is designed to handle first or second order radial derivative data on a real satellite orbit.

In this paper we discuss an earliest arrival flow problem of a network having arc travel times and capacities that vary with time over a finite time horizon T. We also consider the possibility to wait (or park) at a node before departingon outgoing arc. This waiting is bounded by the value of maximum waiting time and the node capacity which also vary with time.

We generalize the classical shortest path problem in two ways. We consider two - in general contradicting - objective functions and introduce a time dependency of the cost which is caused by a traversal time on each arc. The resulting problem, called time-dependent bicriteria shortest path problem (TdBiSP) has several interesting practical applications, but has not attained much attention in the literature.

Hyperquasivarieties
(2003)

A new class of locally supported radial basis functions on the (unit) sphere is introduced by forming an infinite number of convolutions of ''isotropic finite elements''. The resulting up functions show useful properties: They are locally supported and are infinitely often differentiable. The main properties of these kernels are studied in detail. In particular, the development of a multiresolution analysis within the reference space of square--integrable functions over the sphere is given. Altogether, the paper presents a mathematically significant and numerically efficient introduction to multiscale approximation by locally supported radial basis functions on the sphere.