## Fachbereich Mathematik

### Refine

#### Year of publication

- 2005 (38) (remove)

#### Document Type

- Doctoral Thesis (16)
- Preprint (14)
- Diploma Thesis (4)
- Report (3)
- Lecture (1)

#### Keywords

- Wavelet (3)
- Approximation (2)
- Elastoplastizität (2)
- Galerkin-Methode (2)
- Geometric Ergodicity (2)
- Jiang's model (2)
- Jiang-Modell (2)
- Mehrskalenanalyse (2)
- Navier-Stokes-Gleichung (2)
- Sobolev-Raum (2)

- Vector bundles on elliptic curves and factors of automorphy (2005)
- The Atiyah’s results on classification of vector bundles on elliptic curves are translated to the language of factors of automorphy.

- Algebraic and Combinatorial Algorithms for Translinear Network Synthesis (2005)
- This thesis contains the mathematical treatment of a special class of analog microelectronic circuits called translinear circuits. The goal is to provide foundations of a new coherent synthesis approach for this class of circuits. The mathematical methods of the suggested synthesis approach come from graph theory, combinatorics, and from algebraic geometry, in particular symbolic methods from computer algebra. Translinear circuits form a very special class of analog circuits, because they rely on nonlinear device models, but still allow a very structured approach to network analysis and synthesis. Thus, translinear circuits play the role of a bridge between the "unknown space" of nonlinear circuit theory and the very well exploited domain of linear circuit theory. The nonlinear equations describing the behavior of translinear circuits possess a strong algebraic structure that is nonetheless flexible enough for a wide range of nonlinear functionality. Furthermore, translinear circuits offer several technical advantages like high functional density, low supply voltage and insensitivity to temperature. This unique profile is the reason that several authors consider translinear networks as the key to systematic synthesis methods for nonlinear circuits. The thesis proposes the usage of a computer-generated catalog of translinear network topologies as a synthesis tool. The idea to compile such a catalog has grown from the observation that on the one hand, the topology of a translinear network must satisfy strong constraints which severely limit the number of "admissible" topologies, in particular for networks with few transistors, and on the other hand, the topology of a translinear network already fixes its essential behavior, at least for static networks, because the so-called translinear principle requires the continuous parameters of all transistors to be the same. Even though the admissible topologies are heavily restricted, it is a highly nontrivial task to compile such a catalog. Combinatorial techniques have been adapted to undertake this task. In a catalog of translinear network topologies, prototype network equations can be stored along with each topology. When a circuit with a specified behavior is to be designed, one can search the catalog for a network whose equations can be matched with the desired behavior. In this context, two algebraic problems arise: To set up a meaningful equation for a network in the catalog, an elimination of variables must be performed, and to test whether a prototype equation from the catalog and a specified equation of desired behavior can be "matched", a complex system of polynomial equations must be solved, where the solutions are restricted to a finite set of integers. Sophisticated algorithms from computer algebra are applied in both cases to perform the symbolic computations. All mentioned algorithms have been implemented using C++, Singular, and Mathematica, and are successfully applied to actual design problems of humidity sensor circuitry at Analog Microelectronics GmbH, Mainz. As result of the research conducted, an exhaustive catalog of all static formal translinear networks with at most eight transistors is available. The application for the humidity sensor system proves the applicability of the developed synthesis approach. The details and implementations of the algorithms are worked out only for static networks, but can easily be adopted for dynamic networks as well. While the implementation of the combinatorial algorithms is stand-alone software written "from scratch" in C++, the implementation of the algebraic algorithms, namely the symbolic treatment of the network equations and the match finding, heavily rely on the sophisticated Gröbner basis engine of Singular and thus on more than a decade of experience contained in a special-purpose computer algebra system. It should be pointed out that the thesis contains the new observation that the translinear loop equations of a translinear network are precisely represented by the toric ideal of the network's translinear digraph. Altogether, this thesis confirms and strengthenes the key role of translinear circuits as systematically designable nonlinear circuits.

- Notes at the embeddedness of the minimal surface of Costa, Hoffman and Meeks (2005)
- The existence of a complete, embedded minimal surface of genus one, with three ends and whose total Gaussian curvature satisfies equality in the estimate of Jorge and Meeks, was a sensation in the middle eighties. From this moment on, the surface of Costa, Hoffman and Meeks has become famous all around the world, not only in the community of mathematicians. With this article, we want to fill a gap in the injectivity proof of Hoffman and Meeks, where there is a lack of a strict mathematical justification. We exclusively argue topologically and do not use additional properties like differentiability or even holomorphy.

- Meshfree Methods for the Dynamics of Solids (2005)
- Over the last decades, mathematical modeling has reached nearly all fields of natural science. The abstraction and reduction to a mathematical model has proven to be a powerful tool to gain a deeper insight into physical and technical processes. The increasing computing power has made numerical simulations available for many industrial applications. In recent years, mathematicians and engineers have turned there attention to model solid materials. New challenges have been found in the simulation of solids and fluid-structure interactions. In this context, it is indispensable to study the dynamics of elastic solids. Elasticity is a main feature of solid bodies while demanding a great deal of the numerical treatment. There exists a multitude of commercial tools to simulate the behavior of elastic solids. Anyhow, the majority of these software packages consider quasi-stationary problems. In the present work, we are interested in highly dynamical problems, e.g. the rotation of a solid. The applicability to free-boundary problems is a further emphasis of our considerations. In the last years, meshless or particle methods have attracted more and more attention. In many fields of numerical simulation these methods are on a par with classical methods or superior to them. In this work, we present the Finite Pointset Method (FPM) which uses a moving least squares particle approximation operator. The application of this method to various industrial problems at the Fraunhofer ITWM has shown that FPM is particularly suitable for highly dynamical problems with free surfaces and strongly changing geometries. Thereby, FPM offers exactly the features that we require for the analysis of the dynamics of solid bodies. In the present work, we provide a numerical scheme capable to simulate the behavior of elastic solids. We present the system of partial differential equations describing the dynamics of elastic solids and show its hyperbolic character. In particular, we focus our attention to the constitutive law for the stress tensor and provide evolution equations for the deviatoric part of the stress tensor in order to circumvent limitations of the classical Hooke's law. Furthermore, we present the basic principle of the Finite Pointset Method. In particular, we provide the concept of upwinding in a given direction as a key ingredient for stabilizing hyperbolic systems. The main part of this work describes the design of a numerical scheme based on FPM and an operator splitting to take the different processes within a solid body into account. Each resulting subsystem is treated separately in an adequate way. Hereby, we introduce the notion of system-inherent directions and dimensional upwinding. Finally, a coupling strategy for the subsystems and results are presented. We close this work with some final conclusions and an outlook on future work.

- Matrix Decomposition with Times and Cardinality Objectives: Theory, Algorithms and Application to Multileaf Collimator Sequencing (2005)
- In this thesis we have discussed the problem of decomposing an integer matrix \(A\) into a weighted sum \(A=\sum_{k \in {\mathcal K}} \alpha_k Y^k\) of 0-1 matrices with the strict consecutive ones property. We have developed algorithms to find decompositions which minimize the decomposition time \(\sum_{k \in {\mathcal K}} \alpha_k\) and the decomposition cardinality \(|\{ k \in {\mathcal K}: \alpha_k > 0\}|\). In the absence of additional constraints on the 0-1 matrices \(Y^k\) we have given an algorithm that finds the minimal decomposition time in \({\mathcal O}(NM)\) time. For the case that the matrices \(Y^k\) are restricted to shape matrices -- a restriction which is important in the application of our results in radiotherapy -- we have given an \({\mathcal O}(NM^2)\) algorithm. This is achieved by solving an integer programming formulation of the problem by a very efficient combinatorial algorithm. In addition, we have shown that the problem of minimizing decomposition cardinality is strongly NP-hard, even for matrices with one row (and thus for the unconstrained as well as the shape matrix decomposition). Our greedy heuristics are based on the results for the decomposition time problem and produce better results than previously published algorithms.

- Parameter optimization for a stress-strain correction scheme (2005)
- A gradient based algorithm for parameter identification (least-squares) is applied to a multiaxial correction method for elastic stresses and strains at notches. The correction scheme, which is numerically cheap, is based on Jiang's model of elastoplasticity. Both mathematical stress-strain computations (nonlinear PDE with Jiang's constitutive material law) and physical strain measurements have been approximized. The gradient evaluation with respect to the parameters, which is large-scale, is realized by the automatic forward differentiation technique.

- A multiaxial stress-strain correction scheme (2005)
- A method to correct the elastic stress tensor at a fixed point of an elastoplastic body, which is subject to exterior loads, is presented and analysed. In contrast to uniaxial corrections (Neuber or ESED), our method takes multiaxial phenomena like ratchetting or cyclic hardening/softening into account by use of Jiang's model. Our numerical algorithm is designed for the case that the scalar load functions are piecewise linear and can be used in connection with critical plane/multiaxial rainflow methods in high cycle fatigue analysis. In addition, a local existence and uniqueness result of Jiang's equations is given.

- Contributions of the Geomathematics Group to the GAMM 76th Annual Meeting (2005)
- The following three papers present recent developments in nonlinear Galerkin schemes for solving the spherical Navier-Stokes equation, in wavelet theory based on the 3-dimensional ball, and in multiscale solutions of the Poisson equation inside the ball, that have been presented at the 76th GAMM Annual Meeting in Luxemburg. Part A: A Nonlinear Galerkin Scheme Involving Vectorial and Tensorial Spherical Wavelets for Solving the Incompressible Navier-Stokes Equation on the Sphere The spherical Navier-Stokes equation plays a fundamental role in meteorology by modelling meso-scale (stratified) atmospherical flows. This article introduces a wavelet based nonlinear Galerkin method applied to the Navier-Stokes equation on the rotating sphere. In detail, this scheme is implemented by using divergence free vectorial spherical wavelets, and its convergence is proven. To improve numerical efficiency an extension of the spherical panel clustering algorithm to vectorial and tensorial kernels is constructed. This method enables the rapid computation of the wavelet coefficients of the nonlinear advection term. Thereby, we also indicate error estimates. Finally, extensive numerical simulations for the nonlinear interaction of three vortices are presented. Part B: Methods of Resolution for the Poisson Equation on the 3D Ball Within the article at hand, we investigate the Poisson equation solved by an integral operator, originating from an ansatz by Greens functions. This connection between mass distributions and the gravitational force is essential to investigate, especially inside the Earth, where structures and phenomena are not sufficiently known and plumbable. Since the operator stated above does not solve the equation for all square-integrable functions, the solution space will be decomposed by a multiscale analysis in terms of scaling functions. Classical Euclidean wavelet theory appears not to be the appropriate choice. Ansatz functions are chosen to be reflecting the rotational invariance of the ball. In these terms, the operator itself is finally decomposed and replaced by versions more manageable, revealing structural information about itself. Part C: Wavelets on the 3–dimensional Ball In this article wavelets on a ball in R^3 are introduced. Corresponding properties like an approximate identity and decomposition/reconstruction (scale step property) are proved. The advantage of this approach compared to a classical Fourier analysis in orthogonal polynomials is a better localization of the used ansatz functions.

- A Wavelet Approach to Time-Harmonic Maxwells Equations (2005)
- By means of the limit and jump relations of classical potential theory with respect to the vectorial Helmholtz equation a wavelet approach is established on a regular surface. The multiscale procedure is constructed in such a way that the emerging scalar, vectorial and tensorial potential kernels act as scaling functions. Corresponding wavelets are defined via a canonical refinement equation. A tree algorithm for fast decomposition of a complex-valued vector field given on a regular surface is developed based on numerical integration rules. By virtue of this tree algorithm, an effcient numerical method for the solution of vectorial Fredholm integral equations on regular surfaces is discussed in more detail. The resulting multiscale formulation is used to solve boundary-value problems for the time harmonic Maxwell's equations corresponding to regular surfaces.

- Nonlinear Flow in Porous Media - Numerical Solution of the Navier-Stokes System with Two Pressures and Application to Paper Making (2005)
- The aim of the thesis is the numerical investigation of saturated, stationary, incompressible Newtonian flow in porous media when inertia is not negligible. We focus our attention to the Navier-Stokes system with two pressures derived by two-scale homogenization. The thesis is subdivided into five Chapters. After the introductory remarks on porous media, filtration laws and upscaling methods, the first chapter is closed by stating the basic terminology and mathematical fundamentals. In Chapter 2, we start by formulating the Navier-Stokes equations on a periodic porous medium. By two-scale expansions of the velocity and pressure, we formally derive the Navier-Stokes system with two pressures. For the sake of completeness, known existence and uniqueness results are repeated and a convergence proof is given. Finally, we consider Stokes and Navier-Stokes systems with two pressures with respect to their relation to Darcy's law. Chapter 3 and Chapter 4 are devoted to the numerical solution of the nonlinear two pressure system. Therefore, we follow two approaches. The first approach which is developed in Chapter 3 is based on a splitting of the Navier-Stokes system with two pressures into micro and macro problems. The splitting is achieved by Taylor expanding the permeability function or by discretely computing the permeability function. The problems to be solved are a series of Stokes and Navier-Stokes problems on the periodicity cell. The Stokes problems are solved by an Uzawa conjugate gradient method. The Navier-Stokes equations are linearized by a least-squares conjugate gradient method, which leads to the solution of a sequence of Stokes problems. The macro problem consists of solving a nonlinear uniformly elliptic equation of second order. The least-squares linearization is applied to the macro problem leading to a sequence of Poisson problems. All equations will be discretized by finite elements. Numerical results are presented at the end of Chapter 3. The second approach presented in Chapter 4 relies on the variational formulation in a certain Hilbert space setting of the Navier-Stokes system with two pressures. The nonlinear problem is again linearized by the least-squares conjugate gradient method. We obtain a sequence of Stokes systems with two pressures. For the latter systems, we propose a fast solution method which relies on pre-computing Stokes systems on the periodicity cell for finite element basis functions acting as right hand sides. Finally, numerical results are discussed. In Chapter 5 we are concerned with modeling and simulation of the pressing section of a paper machine. We state a two-dimensional model of a press nip which takes into account elasticity and flow phenomena. Nonlinear filtration laws are incorporated into the flow model. We present a numerical solution algorithm and the chapter is closed by a numerical investigation of the model with special focus on inertia effects.