Browsing by Classification (DDC) "ddc:510"
Now showing items 120 of 331

Adaptive numerical simulation of contact problems: Resolving local effects at the contact boundary in space and time
Walloth, Mirjam (20121024)This thesis is concerned with the space discretization of static and the space and time discretization of dynamic contact problems. In particular, we derive a new efficient and reliable residualtype a posteriori error ... 
Adaptive Scattered Data Fitting with Tensor Product SplineWavelets
Castaño Díez, Daniel (2005)The core of the work we present here is an algorithm that constructs a least squares approximation to a given set of unorganized points. The approximation is expressed as a linear combination of particular Bspline wavelets. ... 
Affine Grassmannians and Geometric Satake Equivalences
Richarz, Timo (20140218)The work deals with the geometric Satake equivalence. A new proof is given in the case of a split connected reductive group. Further the work extends the ramified geometric Satake equivalence from tamely ramified groups ... 
Affine nilTemperleyLieb Algebras and Generalized Weyl Algebras: Combinatorics and Representation Theory
Meinel, Joanna (20160913)This thesis lies at the crossroads of representation theory and combinatorics. It is subdivided into two parts, each of which is devoted to a particular combinatorial technique in the study of weight modules.
In the ... 
Algebraic Aspects of Noncommutative Tori: the RiemannHilbert Correspondence
Mahanta, Snigdhayan (2007)In this thesis we have tried to figure out some algebraic aspects of noncommutative tori, aiming at generalizing them to arbitrary noncommutative spaces. In the second section all relevant definitions, some examples and ... 
Algebraic Multigrid (AMG) for Saddle Point Systems
Metsch, Bram (20131011)We introduce an algebraic multigrid method for the solution of matrices with saddle point structure. Such matrices e.g. arise after discretization of a second order partial differential equation (PDE) subject to linear ... 
Algebraic Multigrid for Meshfree Methods
Nick, Fabian Pascal (20200211)This thesis deals with the development of a new Algebraic Multigrid method (AMG) for the solution of linear systems arising from Generalized Finite Difference Methods (GFDM). In particular, we consider the Finite Pointset ... 
Algorithms for Cell Layout
Cremer, Pascal (20190430)Cell layout is a critical step in the design process of computer chips. A cell is a logic function or storage element implemented in CMOS technology by transistors connected with wires. As each cell is used many times on ... 
Algorithms for Circuit Sizing in VLSI Design
Schorr, Ulrike Elisabeth (20160510)One of the key problems in the physical design of computer chips, also known as integrated circuits, consists of choosing a physical layout for the logic gates and memory circuits (registers) on the chip. The layouts ... 
Alternative Finestructural and Computational Approaches to Constructibility
Carl, Merlin (20110714)We consider attempts to simplify finestructural arguments concerning inner models of ZFC, in particular L; in addition, we exhibit different aspects of the computational strength of Infinite Time Register Machines. 
Analysis of Biochemical Reaction Networks using Tropical and Polyhedral Geometry Methods
Samal, Satya Swarup (20161221)The field of systems biology makes an attempt to realise various biological functions and processes as the emergent properties of the underlying biochemical network model. The area of computational systems biology deals ... 
Analysis of martensitic microstructures in shapememoryalloys: A low volumefraction limit
Diermeier, Johannes (20161128)In this work, we study the limiting behavior of a variational model which arises in the analysis of microstructures at austenitemartensite interfaces in shapememory alloys. We consider an energy containing an elastic ... 
Analytic dilation on complete manifolds with corners of codimension 2
Cano Garcia, Leonardo Arturo (20110121)The analytic dilation method was originally used in the context of many body Schrödinger operators. In this thesis we adapt it to the context of compatible Laplacians on complete manifolds with corners of codimension two. ... 
The Analytic Torsion on Manifolds with Boundary and Conical Singularities
Vertman, Boris (2008)The analytic torsion was introduced by D.B. Ray and I.M. Singer as an analytic counterpart to the combinatorial Reidemeister torsion. In this thesis we are concerned with analytic torsion of manifolds with boundary and ...

Analytische und p−adische Aspekte von klassischen und MockModulformen
Fricke, KarlHeinz (20131017)Ausgangsfrage dieser Doktorarbeit war die Gleichverteilung von geschlossenen Geodaetischen im Fundamentalbereich der Modulgruppe in der hyperbolischen Geometrie. Das fuehrt auf das Studium der Eigenfunktionen des ... 
Anisotrope Verfahren in der Bildverarbeitung: Gradientenflüsse, LevelSets und Narrow Bands: Gradientenflüsse, LevelSets und Narrow Bands
Nemitz, Oliver (2008)Isotrope Glättungs und Restaurierungsverfahren neigen dazu, Isoflächen abzurunden. Für beispielsweise ecken oder kantenerhaltendes Glätten oder Restaurieren sind sie nicht geeignet. Stattdessen können anisotrope ...

The ANOVA decomposition and generalized sparse grid methods for the highdimensional backward Kolmogorov equation
Hullmann, Alexander (20150312)In this thesis, we discuss numerical methods for the solution of the highdimensional backward Kolmogorov equation, which arises in the pricing of options on multidimensional jumpdiffusion processes.
First, we apply ... 
An Application of Kolmogorov's Superposition Theorem to Function Reconstruction in Higher Dimensions
Braun, Jürgen (20091201)In this thesis we present a Regularization Network approach to reconstruct a continuous function ƒ:[0,1]^{n}→R from its function values ƒ(x_{j}) on discrete data points x_{j}, ... 
Approximation Algorithms for Traveling Salesman Problems
Traub, Vera (20200415)The traveling salesman problem is the probably most famous problem in combinatorial optimization. Given a graph G and nonnegative edge costs, we want to find a closed walk in G that visits every vertex at least once and ... 
Approximation Complexity of Optimization Problems: Structural Foundations and Steiner Tree Problems
Hauptmann, Mathias (2004)In this thesis we study the approximation complexity of the Steiner Tree Problem and related problems as well as foundations in structural complexity theory. The Steiner Tree Problem is one of the most fundamental problems ...