## Search

Now showing items 21-30 of 61

####
Preprint
Learning analysis by reduction from positive data

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

Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. It can be modelled by restarting automata. In this paper we propose a method for learning restarting automata which are strictly locally testable (SLT-R-automata). The method is based on the concept of identification in the limit from positive examples only. Also we characterize the class of languages accepted by SLT-R-automata with respect to the Chomsky hierarchy.

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

####
Preprint
Error estimates for approximate approximations on compact intervals

(2005)

The aim of this paper is the investigation of the error which results from the
method of approximate approximations applied to functions defined on compact in-
tervals, only. This method, which is based on an approximate partition of unity, was introduced by V. Mazya in 1991 and has mainly been used for functions defied on the whole space up to now. For the treatment of differential equations and boundary integral equations, however, an efficient approximation procedure on compact intervals is needed.
In the ...

####
Preprint
A generic formula for the values at the boundary points of monic classical orthogonal polynomials

(2005)

In a previous paper we have determined a generic formula for the polynomial solution families of the well-known differential equation of hypergeometric type σ(x)y"n(x)+τ(x)y'n(x)-λnyn(x)=0. In this paper, we give another such formula which enables us to present a generic formula for the values of monic classical orthogonal polynomials at their boundary points of definition.

####
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
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
Numerical simulation of tunnel fires using preconditioned finite volume schemes

(2006)

This article is concerned with the numerical simulation of flows at low Mach numbers which are subject to the gravitational force and strong heat sources. As a specific example for such flows, a fire event in a car tunnel will be considered in detail. The low Mach flow is treated with a preconditioning technique allowing the computation of unsteady flows, while the source terms for gravitation and heat are incorporated via operator splitting. It is shown that a first order discretization in space is not able to compute ...

####
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
Shrinking restarting automata

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

Restarting automata are a restricted model of computation that was introduced by Jancar et.al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Thus, each language accepted by a restarting automaton belongs to the complexity class $CSL cap NP$. Here we consider a natural generalization of this model, ...

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