## Search

Now showing items 41-50 of 61

####
Preprint
The Parity of the Number of Irreducible Factors for Some Pentanomials

(2008)

It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials,
tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials namely x^m +x^{n+2} +x^{n+1} +x^n +1 \in\ IF_2 [x].
Such pentanomials can be used for efficient implementing multiplication ...

####
Preprint
Approximate solutions and error estimates for a Stokes boundary value problem

(2009)

The aim of this paper is the numerical treatment of a boundary value
problem for the system of Stokes' equations. For this we extend the method
of approximate approximations to boundary value problems. This method
was introduced by V. Maz'ya in 1991 and has been used until now for the
approximation of smooth functions defined on the whole space and for the
approximation of volume potentials.
In the present paper we develop an approximation procedure for the solution
of the interior Dirichlet problem for the ...

####
Preprint
On Nonlinear Preconditioners in Newton-Krylov-Methods for Unsteady Flows

(2008)

The application of nonlinear schemes like dual time stepping as preconditioners in matrix-free Newton-Krylov-solvers is considered and analyzed. We provide a novel formulation of the left preconditioned operator that says it is in fact linear in the matrix-free sense, but changes the Newton scheme. This allows to get some insight in the convergence properties of these schemes which are demonstrated through numerical results.

####
Preprint
Negative Größen bei Diophant?

(Universität Kassel, FB 17, Mathematik/Informatik, 2005)

In this paper we champion Diophantus of Alexandria and Isabella Basmakova against Norbert Schappacher. In two publications ([46] and [47]) he puts forward inter alia two propositions: Questioning Diophantus' originality he considers affirmatively the possibility, that the Arithmetica are the joint work of a team of authors like Bourbaki. And he calls Basmakova's claim (in [5]), that Diophantus uses negative numbers, a "nonsense", reproaching her for her "thoughtlessness". First, we disprove Schappacher's Bourbaki ...

####
Preprint
Bieberbach's Conjecture, the de Branges and Weinstein Functions and the Askey-Gasper Inequality

(2005)

The Bieberbach conjecture about the coefficients of univalent functions of the unit disk was formulated by Ludwig Bieberbach in 1916 [Bieberbach1916]. The conjecture states that the coefficients of univalent functions are majorized by those of the Koebe function which maps the unit disk onto a radially slit plane. The Bieberbach conjecture was quite a difficult problem, and it was surprisingly proved by Louis de Branges in 1984 [deBranges1985] when some experts were rather trying to disprove it. It turned out that ...

####
Preprint
A crack on the interface of piezo-electric bodies

(Universität Kassel, FB 17, Mathematik/Informatik, 2005)

Singularities of elastic and electric fields are investigated at the tip of a crack on the interface of two anisotropic piezo-electric media under various boundary conditions on the crack surfaces. The Griffith formulae are obtained for increments of energy functionals due to growth of the crack and the notion of the energy release matrix is introduced. Normalization conditions for bases of singular solution are proposed to adapt them to the energy, stress, and deformation fracture criteria. Connections between these ...

####
Preprint
Degrees of Free Word-Order and Freely Rewriting Restarting Automata

(Universität Kassel, FB 17, Mathematik/Informatik, 2005)

In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the ...

####
Preprint
A generic polynomial solution for the differential equation of hypergeometric type and six sequences of orthogonal polynomials related to it

(2005)

In this work, we present a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type s(x)y"n(x) + t(x)y'n(x) - lnyn(x) = 0 and show that all the three classical orthogonal polynomial families as well as three finite orthogonal polynomial families, extracted from this equation, can be identified as special cases of this derived polynomial sequence. Some general properties of this sequence are also given.

####
Preprint
Modellierung und numerische Simulation der Thermoregulation von Früh- und Neugeborenen

(Universität Kassel, FB 17, Mathematik/Informatik, 2005)

Bei frühgeborenen Säuglingen spielt die Thermoregulation zur Aufrechterhaltung einer überlebenswichtigen Körpertemperatur durch Wärmeproduktion, -abgabe bzw. -aufnahme eine entscheidende Rolle. Der Einsatz moderner Inkubatoren soll die körpereigenen Thermoregulatoren unterstützen, und es ist im Hinblick auf verschiedene medizinische Fragestellungen wünschenswert, diesen Prozess modellieren zu können. Wir stellen ein einfaches Modell auf der Basis von partiellen Differentialgleichungen vor und beschreiben detailliert ...

####
Preprint
Asymptotics of number fields and the Cohen-Lenstra heuristics

(Universität Kassel, FB 17, Mathematik/Informatik, 2005)

We study the asymptotics conjecture of Malle for dihedral groups Dl of order 2l, where l is an odd prime. We prove the expected lower bound for those groups. For the upper bounds we show that there is a connection to class groups of quadratic number fields. The asymptotic behavior of those class groups is predicted by the Cohen-Lenstra heuristics. Under the assumption of this heuristic we are able to prove the expected upper bounds.