Suche
Anzeige der Dokumente 131-140 von 209
Aufsatz
The Impact of Visualizing Nested Sets. An Empirical Study on Tree Diagrams and Unit Squares
(2017-01-06)
It is an ongoing debate, what properties of visualizations increase people’s performance when solving Bayesian reasoning tasks. In the discussion of the properties of two visualizations, i.e., the tree diagram and the unit square, we emphasize how both visualizations make relevant subset relations transparent. Actually, the unit square with natural frequencies reveals the subset relation that is essential for the Bayes’ rule in a numerical and geometrical way whereas the tree diagram with natural frequencies does it ...
Habilitation
Algorithmic Methods for Mixed Recurrence Equations, Zeros of Classical Orthogonal Polynomials and Classical Orthogonal Polynomial Solutions of Three-Term Recurrence Equations
(2019-07)
Using an algorithmic approach, we derive classes of mixed recurrence equations satisfied by classical orthogonal polynomials. Starting from certain structure relations satisfied by classical orthogonal polynomials or their connection formulae, we show that our mixed recurrence equations are structurally valid. However, they couldn't be easily obtained with classical methods and for this reason, our algorithmic approach is important. The main algorithmic tool used here is an extended version of Zeilberger's ...
Dissertation
Explicit Description Of Isogeny And Isomorphism Classes Of Drinfeld Modules Of Higher Rank Over Finite Fields
(2020)
When jumping from the number fields theory to the function fields theory, one cannot miss the deep analogy between rank 1 Drinfeld modules and the group of root of unity and the analogy between rank 2 Drinfeld modules and elliptic curves. But so far, there is no known structure in number fields theory that is analogous to the Drinfeld modules of higher rank r ≥ 3. In this thesis we investigate the classes of those Drinfeld modules of higher rank r ≥ 3 defined over a finite field L. We describe explicitly the Weil ...
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
Approximate approximations for the Poisson and the Stokes equations
(2006)
The method of approximate approximations is based on generating functions representing an approximate partition of the unity, only. In the present paper this method is used for the numerical solution of the Poisson equation and the Stokes system in R^n (n = 2, 3). The corresponding approximate volume potentials will be computed explicitly in these cases, containing a one-dimensional integral, only. Numerical simulations show the efficiency of the method and confirm the expected convergence of essentially second order, ...
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
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
The Parity of the Number of Irreducible Factors for Some Pentanomials
(2008)
It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials,
tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials namely x^m +x^{n+2} +x^{n+1} +x^n +1 \in\ IF_2 [x].
Such pentanomials can be used for efficient implementing multiplication ...
Preprint
On Nonlinear Preconditioners in Newton-Krylov-Methods for Unsteady Flows
(2008)
The application of nonlinear schemes like dual time stepping as preconditioners in matrix-free Newton-Krylov-solvers is considered and analyzed. We provide a novel formulation of the left preconditioned operator that says it is in fact linear in the matrix-free sense, but changes the Newton scheme. This allows to get some insight in the convergence properties of these schemes which are demonstrated through numerical results.
Aufsatz
Entwicklung und Erprobung eines Tests zur "mathematischen Leistungsfähigkeit" deutscher und englischer Lernender in der Sekundarstufe I
(1994)
Im Rahmen von empirischen Untersuchungen zum Lehren und Lernen von Mathematik haben wir
einen Test entwickelt ("Potentialtest"), der die "mathematische Leistungsfähigkeit" von
13/14jährigen Jugendlichen in England und Deutschland für Vergleichszwecke messen soll. Im vorliegenden Beitrag beschreiben wir die Entstehung des Tests sowie Resultate der Durchführung des Tests bei 1036 englischen und deutschen Lernenden. Die Resultate werden unter Berücksichtigung von - aus unseren früheren Fallstudien bekannten - ...