Suche
Anzeige der Dokumente 11-16 von 16
Preprint
Computations in Relative Algebraic K-Groups
(2007)
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 ...
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
Approximate Approximations and a Boundary Point Method for the Linearized Stokes System
(2007)
The method of approximate approximations, introduced by Maz'ya [1], can also be used for the numerical solution of boundary integral equations. In this case, the matrix
of the resulting algebraic system to compute an approximate source density depends only on the position of a finite number of boundary points and on the direction of the normal vector in these points (Boundary Point Method). We investigate this approach for the Stokes problem in the whole space and for the Stokes boundary value problem in a bounded ...
Preprint
Computing Generators of Free Modules over Orders in Group Algebras
(2007)
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines ...
Preprint
Functions satisfying holonomic q-differential equations
(2007-05-21)
In a similar manner as in some previous papers, where explicit algorithms for finding the differential equations satisfied by holonomic functions were given, in this paper we deal with the space of the q-holonomic functions which are the solutions of linear q-differential equations with polynomial coefficients. The sum, product and the composition with power functions of q-holonomic functions are also q-holonomic and the resulting q-differential equations can be computed algorithmically.