Search
Now showing items 111-120 of 262
Habilitation
Algorithmic Methods for Mixed Recurrence Equations, Zeros of Classical Orthogonal Polynomials and Classical Orthogonal Polynomial Solutions of Three-Term Recurrence Equations
(2019-07)
Using an algorithmic approach, we derive classes of mixed recurrence equations satisfied by classical orthogonal polynomials. Starting from certain structure relations satisfied by classical orthogonal polynomials or their connection formulae, we show that our mixed recurrence equations are structurally valid. However, they couldn't be easily obtained with classical methods and for this reason, our algorithmic approach is important. The main algorithmic tool used here is an extended version of Zeilberger's ...
Buch
Didactics of Mathematics in Higher Education as a Scientific Discipline
(2017-03-15)
Mathematics education at the tertiary level is a practical concern in many institutions of higher education, and efforts are being made world-wide to improve its quality. A growing number of mathematicians and mathematics educators see the need for doing research and thoughtful development work in mathematics education not only at school level, but also at tertiary level. To give momentum to the establishment of a scientific community of mathematicians and mathematics educators whose concern is the theoretical ...
Buch
Stochastische Simulation von Zufallsexperimenten mit Fathom
(Franzbecker, Hildesheim, 2010)
In der Mathematikdidaktik gibt es die weit verbreitete Auffassung, durch die Verwendung von Simulationen Lernprozesse zu unterstützen. Dies hat mich im Rahmen meiner Dissertation dazu bewogen, erstens eine Werkzeuganalyse des Simulationspotentials der Software Fathom durchzuführen und zweitens exemplarische Analysen dazu, wie Lernende mit der Software arbeiten.
Bei der Werkzeuganalyse standen vor allem folgende zwei Fragen im Mittelpunkt: Was bietet die Software an Simulationspotential? Wie gut und leicht lassen ...
Preprint
Preconditioner updates applied to CFD model problems
(2007)
In the present paper we concentrate on solving sequences of nonsymmetric linear systems with block structure arising from compressible flow problems. We attempt to improve the solution process by sharing part of the computational effort throughout the sequence. This is achieved by application of a cheap updating technique for preconditioners which we adapted in order to be used for our applications. Tested on three benchmark compressible flow problems, the strategy speeds up the entire computation with an acceleration ...
Preprint
The Navier-Stokes Equations with Particle Methods
(2007)
The non-stationary nonlinear Navier-Stokes equations describe the motion of a viscous incompressible fluid flow for 0<t≤T in some bounded three-dimensional domain.
Up to now it is not known wether these equations are well-posed or not. Therefore we use a particle method to develop a system of approximate equations. We show that this system can be solved uniquely and globally in time and that its solution has a high degree of spatial regularity. Moreover we prove that the system of approximate solutions has an ...
Preprint
Lagrangian approximations and weak solutions of the Navier-Stokes equations
(2007)
The motion of a viscous incompressible fluid flow in bounded domains with a smooth boundary can be described by the nonlinear Navier-Stokes equations. This description corresponds to the so-called Eulerian approach. We develop a new approximation method for the Navier-Stokes equations in both the stationary and the non-stationary case by a suitable coupling of the Eulerian and the Lagrangian representation of the flow, where the latter is defined by the trajectories of the particles of the fluid. The method leads to ...
Preprint
Parity of the Number of Irreducible Factors for Composite Polynomials
(2008)
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The relation between the discriminants of composed polynomial and the original ones will be established. We apply this to obtain ...
Dissertation
Algorithms for Tamagawa Number Conjectures
(2011-06-09)
In dieser Arbeit werden Algorithmen zur Untersuchung der äquivarianten Tamagawazahlvermutung von Burns und Flach entwickelt. Zunächst werden Algorithmen angegeben mit denen die lokale Fundamentalklasse, die globale Fundamentalklasse und Tates kanonische Klasse berechnet werden können. Dies ermöglicht unter anderem Berechnungen in Brauergruppen von Zahlkörpererweiterungen. Anschließend werden diese Algorithmen auf die Tamagawazahlvermutung angewendet. Die Epsilonkonstantenvermutung kann dadurch für alle Galoiserweiterungen ...
Dissertation
Algorithmen für q-holonome Funktionen und q-hypergeometrische Reihen
(2009-07-21)
Die q-Analysis ist eine spezielle Diskretisierung der Analysis auf einem Gitter, welches eine geometrische Folge darstellt, und findet insbesondere in der Quantenphysik eine breite Anwendung, ist aber auch in der Theorie der q-orthogonalen Polynome und speziellen Funktionen von großer Bedeutung. Die betrachteten mathematischen Objekte aus der q-Welt weisen meist eine recht komplizierte Struktur auf und es liegt daher nahe, sie mit Computeralgebrasystemen zu behandeln. In der vorliegenden Dissertation werden Algorithmen ...
Dissertation
On the solutions of holonomic third-order linear irreducible differential equations in terms of hypergeometric functions
(2018-06-06)
Sei k ein algebraisch abgeschlossener Erweiterungskörper von Q der Charakteristik 0 und k(x)[∂] der Ring der Differentialoperatoren mit Koeffizienten in k(x). Sei L ∈ k(x)[∂] ein irreduzibler Differentialoperator dritter Ordung ohne Liouvillesche Lösungen. Sei E = B_^2, 1F_1^2, 0F_2, 1F_2, 2F_2}, wobei B_v eine Besselfunktion ist und pF_q mit p ∈ {0,1,2},q ∈{1,2}, die verallgemeinerte hypergeometrische Funktion. Das Ziel dieser Dissertation ist es, Lösungen von L zu finden, die durch Elemente S ∈ E ausgedrückt werden ...