Kaiserslautern - Fachbereich Mathematik
Refine
Year of publication
- 2007 (34) (remove)
Document Type
- Doctoral Thesis (14)
- Preprint (14)
- Diploma Thesis (3)
- Report (3)
Has Fulltext
- yes (34)
Keywords
- Elastoplastizität (2)
- Mixture Models (2)
- Multiresolution Analysis (2)
- Optionspreistheorie (2)
- Sobolev spaces (2)
- Spline-Approximation (2)
- localizing basis (2)
- 2-d kernel regression (1)
- A-infinity-bimodule (1)
- A-infinity-category (1)
- A-infinity-functor (1)
- Adjazenz-Beziehungen (1)
- Algorithmics (1)
- Asympotic Analysis (1)
- Asymptotic Analysis (1)
- Asymptotic Expansion (1)
- Asymptotische Entwicklung (1)
- Biorthogonalisation (1)
- Bondindizes (1)
- Continuum mechanics (1)
- Earth's disturbing potential (1)
- Elasticity (1)
- Elastizität (1)
- Elastoplasticity (1)
- Endliche Geometrie (1)
- Finanzmathematik (1)
- Gauge Distances (1)
- Geometric Ergodicity (1)
- Geostrophic flow (1)
- Granular flow (1)
- Hamilton-Jacobi-Differentialgleichung (1)
- Harmonische Spline-Funktion (1)
- Helmholtz Type Boundary Value Problems (1)
- Homologische Algebra (1)
- Homotopiehochhebungen (1)
- Homotopy lifting (1)
- Hysterese (1)
- Identifiability (1)
- Injectivity of mappings (1)
- Injektivität von Abbildungen (1)
- Internationale Diversifikation (1)
- Inverses Problem (1)
- Jiang's constitutive model (1)
- Jiangsches konstitutives Gesetz (1)
- Kategorientheorie (1)
- Knapsack (1)
- Kombinatorische Optimierung (1)
- Kontinuumsmechanik (1)
- Legendre Wavelets (1)
- Lineare Integralgleichung (1)
- Locally Supported Zonal Kernels (1)
- Location Theory (1)
- Machine Scheduling (1)
- Markov Chain (1)
- Mehrdimensionale Spline-Funktion (1)
- Minimal spannender Baum (1)
- NP (1)
- Neural networks (1)
- Nichtlineare/große Verformungen (1)
- Nonlinear/large deformations (1)
- Nonparametric AR-ARCH (1)
- Optimale Portfolios (1)
- Optimization (1)
- Ovoid (1)
- Portfoliomanagement (1)
- Quadratischer Raum (1)
- Radial Basis Functions (1)
- Randwertproblem (1)
- Ratenunabhängigkeit (1)
- Seismische Tomographie (1)
- Serre functor (1)
- Sobolevräume (1)
- Spherical Fast Wavelet Transform (1)
- Spherical Wavelets (1)
- Sphärische Approximation (1)
- Spline-Interpolation (1)
- Sprung-Diffusions-Prozesse (1)
- Stochastische Zinsen (1)
- Stochastische dynamische Optimierung (1)
- Stop- und Spieloperator (1)
- Time-Space Multiresolution Analysis (1)
- Transaktionskosten (1)
- Variationsungleichungen (1)
- Vectorfield approximation (1)
- Vektorfeldapproximation (1)
- Volatilität (1)
- Wave Based Method (1)
- adjacency relations (1)
- algorithm (1)
- bocses (1)
- boundary value problem (1)
- combinatorial optimization (1)
- conditional quantile (1)
- consistency (1)
- convergence (1)
- cut (1)
- cut basis problem (1)
- data structure (1)
- data-adaptive bandwidth choice (1)
- deflections of the vertical (1)
- degenerations of an elliptic curve (1)
- density gradient equation (1)
- elastoplasticity (1)
- finite volume method (1)
- fluid structure (1)
- fundamental cut (1)
- graph and network algorithm (1)
- heuristic (1)
- hub location (1)
- hyperbolic systems (1)
- hysteresis (1)
- image analysis (1)
- image denoising (1)
- integer programming (1)
- interface problem (1)
- inverse problem (1)
- inverse problems (1)
- iterative bandwidth choice (1)
- knapsack (1)
- lattice Boltzmann (1)
- local approximation of sea surface topography (1)
- local bandwidths (1)
- local multiscale (1)
- localization (1)
- locally supported (Green's) vector wavelets (1)
- locally supported (Green’s) vector wavelets (1)
- lokalisierende Basis (1)
- matrix problems (1)
- minimal spanning tree (1)
- minimum cost flows (1)
- minimum fundamental cut basis (1)
- multicategory (1)
- multigrid method (1)
- network flows (1)
- neural network (1)
- nonlinear diffusion filtering (1)
- nonlinear finite element method (1)
- numerics (1)
- penalization (1)
- polyhedral analysis (1)
- poroelasticity (1)
- qualitative threshold model (1)
- rate-independency (1)
- regularization (1)
- seismic tomography (1)
- sieve estimate (1)
- smoothing (1)
- spherical approximation (1)
- splines (1)
- stop- and play-operator (1)
- time series (1)
- topological asymptotic expansion (1)
- uncapacitated facility location (1)
- variational inequalities (1)
- vector bundles (1)
Faculty / Organisational entity
Diese Arbeit beschäftigt sich mit Methoden zur Klassifikation von Ovoiden in quadratischen Räumen. Die Anwendung der dazu entwickelten Algorithmen erfolgt hauptsächlich in achtdimensionalen Räumen speziell über den Körpern GF(7), GF(8) und GF(9). Zu verschiedenen, zumeist kleinen, zyklischen Gruppen werden hier die unter diesen Gruppen invarianten Ovoide bestimmt. Die bei dieser Suche auftretenden Ovoide sind alle bereits bekannt. Es ergeben sich jedoch Restriktionen an die Stabilisatoren gegebenenfalls existierender, unbekannter Ovoide.
The main aim of this work was to obtain an approximate solution of the seismic traveltime tomography problems with the help of splines based on reproducing kernel Sobolev spaces. In order to be able to apply the spline approximation concept to surface wave as well as to body wave tomography problems, the spherical spline approximation concept was extended for the case where the domain of the function to be approximated is an arbitrary compact set in R^n and a finite number of discontinuity points is allowed. We present applications of such spline method to seismic surface wave as well as body wave tomography, and discuss the theoretical and numerical aspects of such applications. Moreover, we run numerous numerical tests that justify the theoretical considerations.
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to find a spanning tree of total edge weight at most a given value W and minimum total costs under this restriction. In this thesis a literature overview on this NP-hard problem, theoretical properties concerning the convex hull and the Lagrangian relaxation are given. We present also some in- and exclusion-test for this problem. We apply a ranking algorithm and the method of approximation through decomposition to our problem and design also a new branch and bound scheme. The numerical results show that this new solution approach performs better than the existing algorithms.
In this article we give a sufficient condition that a simply connected flexible body does not penetrate itself, if it is subjected to a continuous deformation. It is shown that the deformation map is automatically injective, if it is just locally injective and injective on the boundary of the body. Thereby, it is very remarkable that no higher regularity assumption than continuity for the deformation map is required. The proof exclusively relies on homotopy methods and the Jordan-Brouwer separation theorem.
This dissertation is intended to transport the theory of Serre functors into the context of A-infinity-categories. We begin with an introduction to multicategories and closed multicategories, which form a framework in which the theory of A-infinity-categories is developed. We prove that (unital) A-infinity-categories constitute a closed symmetric multicategory. We define the notion of A-infinity-bimodule similarly to Tradler and show that it is equivalent to an A-infinity-functor of two arguments which takes values in the differential graded category of complexes of k-modules, where k is a commutative ground ring. Serre A-infinity-functors are defined via A-infinity-bimodules following ideas of Kontsevich and Soibelman. We prove that a unital closed under shifts A-infinity-category over a field admits a Serre A-infinity-functor if and only if its homotopy category admits an ordinary Serre functor. The proof uses categories and Serre functors enriched in the homotopy category of complexes of k-modules. Another important ingredient is an A-infinity-version of the Yoneda Lemma.
Given a directed graph G = (N,A) with arc capacities u and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector u' for the arc set A such that a given feasible flow x' is optimal with respect to the modified capacities. Among all capacity vectors u' satisfying this condition, we would like to find one with minimum ||u' - u|| value. We consider two distance measures for ||u' - u||, rectilinear and Chebyshev distances. By reduction from the feedback arc set problem we show that the capacity inverse minimum cost flow problem is NP-hard in the rectilinear case. On the other hand, it is polynomially solvable by a greedy algorithm for the Chebyshev norm. In the latter case we propose a heuristic for the bicriteria problem, where we minimize among all optimal solutions the number of affected arcs. We also present computational results for this heuristic.
In this paper we construct spline functions based on a reproducing kernel Hilbert space to interpolate/approximate the velocity field of earthquake waves inside the Earth based on traveltime data for an inhomogeneous grid of sources (hypocenters) and receivers (seismic stations). Theoretical aspects including error estimates and convergence results as well as numerical results are demonstrated.
Given an undirected, connected network G = (V,E) with weights on the edges, the cut basis problem is asking for a maximal number of linear independent cuts such that the sum of the cut weights is minimized. Surprisingly, this problem has not attained as much attention as its graph theoretic counterpart, the cycle basis problem. We consider two versions of the problem, the unconstrained and the fundamental cut basis problem. For the unconstrained case, where the cuts in the basis can be of an arbitrary kind, the problem can be written as a multiterminal network flow problem and is thus solvable in strongly polynomial time. The complexity of this algorithm improves the complexity of the best algorithms for the cycle basis problem, such that it is preferable for cycle basis problems in planar graphs. In contrast, the fundamental cut basis problem, where all cuts in the basis are obtained by deleting an edge, each, from a spanning tree T is shown to be NP-hard. We present heuristics, integer programming formulations and summarize first experiences with numerical tests.
In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show which of the valid inequalities in this formulation are facet-defining and present non-elementary classes of facets, for which we propose separation problems. A major part in our argumentation will be the close connection between polytopes of the USApHCP and the uncapacitated p-facility location (pUFL). Hence, the new classes of facets can also be used to improve pUFL formulations.
In this dissertation we present analysis of macroscopic models for slow dense granular flow. Models are derived from plasticity theory with yield condition and flow rule. Corner stone equations are conservation of mass and conservation of momentum with special constitutive law. Such models are considered in the class of generalised Newtonian fluids, where viscosity depends on the pressure and modulo of the strain-rate tensor. We showed the hyperbolic nature for the evolutionary model in 1D and ill-posed behaviour for 2D and 3D. The steady state equations are always hyperbolic. In the 2D problem we derived a prototype nonlinear backward parabolic equation for the velocity and the similar equation for the shear-rate. Analysis of derived PDE showed the finite blow up time. Blow up time depends on the initial condition. Full 2D and antiplane 3D model were investigated numerically with finite element method. For 2D model we showed the presence of boundary layers. Antiplane 3D model was investigated with the Runge Kutta Discontinuous Galerkin method with mesh addoption. Numerical results confirmed that such a numerical method can be a good choice for the simulations of the slow dense granular flow.