Now showing items 21-30 of 53
A generic formula for the values at the boundary points of monic classical orthogonal polynomials
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.
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 ( and ) 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 ), that Diophantus uses negative numbers, a "nonsense", reproaching her for her "thoughtlessness". First, we disprove Schappacher's Bourbaki ...
Preconditioner updates applied to CFD model problems
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 ...
Numerical simulation of tunnel fires using preconditioned finite volume schemes
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 ...
The Navier-Stokes Equations with Particle Methods
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 ...
Lagrangian approximations and weak solutions of the Navier-Stokes equations
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 ...
Construction of recurrent fractal interpolation surfaces(RFISs) on rectangular grids
A recurrent iterated function system (RIFS) is a genaralization of an IFS and provides nonself-affine fractal sets which are closer to natural objects. In general, it's attractor is not a continuous surface in R3. A recurrent fractal interpolation surface (RFIS) is an attractor of RIFS which is a graph of bivariate continuous interpolation function. We introduce a general method of generating recurrent interpolation surface which are at- tractors of RIFSs about any data set on a grid.
Construction of fractal interpolation surfaces on rectangular grids
We present a general method of generating continuous fractal interpolation surfaces by iterated function systems on an arbitrary data set over rectangular grids and estimate their Box-counting dimension.
Computations in Relative Algebraic K-Groups
Let G be finite group and K a number field or a p-adic field with ring of integers O_K. In the first part of the manuscript we present an algorithm that computes the relative algebraic K-group K_0(O_K[G],K) as an abstract abelian group. We solve the discrete logarithm problem, both in K_0(O_K[G],K) and the locally free class group cl(O_K[G]). All algorithms have been implemented in MAGMA for the case K = \IQ. In the second part of the manuscript we prove formulae for the torsion subgroup of K_0(\IZ[G],\IQ) for large ...