## Search

Now showing items 21-30 of 53

####
Preprint
The Navier-Stokes Equations with Time Delay

(2007)

In the present paper we use a time delay epsilon > 0 for an energy conserving approximation of the nonlinear term of the non-stationary Navier-Stokes equations. We prove that the corresponding initial value problem (N_epsilon)in smoothly bounded domains G \subseteq R^3 is well-posed. Passing to the limit epsilon \rightarrow 0 we show that the sequence of stabilized solutions has an accumulation point such that it solves the Navier-Stokes problem (N_0) in a weak sense (Hopf).

####
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 ...

####
Preprint
Statistical Analysis of Diabetes Mellitus

(2009)

Diabetes mellitus is a disease where the glucosis-content of the blood does not automatically
decrease to a ”normal” value between 70 mg/dl and 120 mg/dl (3,89 mmol/l and
6,67 mmol/l) between perhaps one hour (or two hours) after eating. Several instruments
can be used to arrive at a relative low increase of the glucosis-content. Besides drugs (oral
antidiabetica, insulin) the blood-sugar content can mainly be influenced by
(i) eating, i.e., consumption of the right amount of food at the right time
(ii) physical ...

####
Preprint
On Oseen Resolvent Estimates: A Negative Result

(2009)

We consider the resolvent problem for the scalar Oseen equation in the whole space R^3. We show that for small values of the resolvent parameter it is impossible to obtain an L^2-estimate analogous to
the one which is valid for the Stokes resolvent, even if the resolvent
parameter has positive real part.

####
Preprint
On the relationship between the Method of Least Squares and Gram-Schmidt orthogonalization

(2010)

The method of Least Squares is due to Carl Friedrich Gauss. The Gram-Schmidt
orthogonalization method is of much younger date. A method for solving Least Squares Problems is developed which automatically results in the appearance of the Gram-Schmidt orthogonalizers. Given these orthogonalizers an induction-proof is available for solving Least Squares Problems.

####
Preprint
On Solution Sets of Information Inequalities

(2011)

We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce important properties of Bayesian networks, which is important within causal inference.

####
Preprint
Exact algorithms for p-adic fields and epsilon constant conjectures

(2006)

We develop several algorithms for computations in Galois extensions of p-adic fields. Our algorithms are based on existing algorithms for number fields and are exact in the sense that we do not need to consider approximations to p-adic numbers. As an application we describe an algorithmic approach to prove or disprove various conjectures for local and global epsilon constants.

####
Preprint
Solution properties of the de Branges differential recurrence equation

(2005)

In this 1984 proof of the Bieberbach and Milin conjectures de Branges used a positivity result of special functions which follows from an identity about Jacobi polynomial sums thas was published by Askey and Gasper in 1976. The de Branges functions Tn/k(t) are defined as the solutions of a system of differential recurrence equations with suitably given initial values. The essential fact used in the proof of the Bieberbach and Milin conjectures is the statement Tn/k(t)<=0. In 1991 Weinstein presented another proof of ...