Search
Now showing items 51-54 of 54
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
Convergence analysis of time-discretization schemes for rate-independent systems
(2017-12-21)
It is well known that rate-independent systems involving nonconvex energy functionals in general do not allow for time-continuous solutions even if the given data are smooth. In the last years, several solution concepts were proposed that include discontinuities in the notion of solution, among them the class of global energetic solutions and the class of BV-solutions. In general, these solution concepts are not equivalent and numerical schemes are needed that reliably approximate that type of solutions one is ...
Preprint
Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach
(2010)
Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the ...
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.