Some New Classes of Orthogonal Polynomials and Special Functions

In dieser Dissertation präsentieren wir zunächst eine Verallgemeinerung der üblichen Sturm-Liouville-Probleme mit symmetrischen Lösungen und erklären eine umfassendere Klasse. Dann führen wir einige neue Klassen orthogonaler Polynome und spezieller Funktionen ein, welche sich aus dieser symmetrischen Verallgemeinerung ableiten lassen. Als eine spezielle Konsequenz dieser Verallgemeinerung führen wir ein Polynomsystem mit vier freien Parametern ein und zeigen, dass in diesem System fast alle klassischen symmetrischen orthogonalen Polynome wie die Legendrepolynome, die Chebyshevpolynome erster und zweiter Art, die Gegenbauerpolynome, die verallgemeinerten Gegenbauerpolynome, die Hermitepolynome, die verallgemeinerten Hermitepolynome und zwei weitere neue endliche Systeme orthogonaler Polynome enthalten sind. All diese Polynome können direkt durch das neu eingeführte System ausgedrückt werden. Ferner bestimmen wir alle Standardeigenschaften des neuen Systems, insbesondere eine explizite Darstellung, eine Differentialgleichung zweiter Ordnung, eine generische Orthogonalitätsbeziehung sowie eine generische Dreitermrekursion. Außerdem benutzen wir diese Erweiterung, um die assoziierten Legendrefunktionen, welche viele Anwendungen in Physik und Ingenieurwissenschaften haben, zu verallgemeinern, und wir zeigen, dass diese Verallgemeinerung Orthogonalitätseigenschaft und -intervall erhält. In einem weiteren Kapitel der Dissertation studieren wir detailliert die Standardeigenschaften endlicher orthogonaler Polynomsysteme, welche sich aus der üblichen Sturm-Liouville-Theorie ergeben und wir zeigen, dass sie orthogonal bezüglich der Fisherschen F-Verteilung, der inversen Gammaverteilung und der verallgemeinerten t-Verteilung sind. Im nächsten Abschnitt der Dissertation betrachten wir eine vierparametrige Verallgemeinerung der Studentschen t-Verteilung. Wir zeigen, dass diese Verteilung gegen die Normalverteilung konvergiert, wenn die Anzahl der Stichprobe gegen Unendlich strebt. Eine ähnliche Verallgemeinerung der Fisherschen F-Verteilung konvergiert gegen die chi-Quadrat-Verteilung. Ferner führen wir im letzten Abschnitt der Dissertation einige neue Folgen spezieller Funktionen ein, welche Anwendungen bei der Lösung in Kugelkoordinaten der klassischen Potentialgleichung, der Wärmeleitungsgleichung und der Wellengleichung haben. Schließlich erklären wir zwei neue Klassen rationaler orthogonaler hypergeometrischer Funktionen, und wir zeigen unter Benutzung der Fouriertransformation und der Parsevalschen Gleichung, dass es sich um endliche Orthogonalsysteme mit Gewichtsfunktionen vom Gammatyp handelt.

Convexity of the extreme zeros of Gegenbauer and Laguerre polynomials

Let C-n(lambda)(x), n = 0, 1,..., lambda > -1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal. in (-1, 1) with respect to the weight function (1 - x(2))(lambda-1/2). Denote by X-nk(lambda), k = 1,....,n, the zeros of C-n(lambda)(x) enumerated in decreasing order. In this short note, we prove that, for any n is an element of N, the product (lambda + 1)(3/2)x(n1)(lambda) is a convex function of lambda if lambda greater than or equal to 0. The result is applied to obtain some inequalities for the largest zeros of C-n(lambda)(x). If X-nk(alpha), k = 1,...,n, are the zeros of Laguerre polynomial L-n(alpha)(x), also enumerated in decreasing order, we prove that x(n1)(lambda)/(alpha + 1) is a convex function of alpha for alpha > - 1. (C) 2002 Published by Elsevier B.V. B.V.

Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

DJKM ALGEBRAS I: THEIR UNIVERSAL CENTRAL EXTENSION

The purpose of this paper is to explicitly describe in terms of generators and relations the universal central extension of the infinite dimensional Lie algebra, g circle times C[t, t(-1), u vertical bar u(2) = (t(2) - b(2))(t(2) - c(2))], appearing in the work of Date, Jimbo, Kashiwara and Miwa in their study of integrable systems arising from the Landau-Lifshitz differential equation.

An extremal nonnegative sine polynomial

For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn (θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each Pi 1 ≤ P ≤ ∞ and for any 27π-periodic function f ∈ Lp [-π, π], the sequence of convolutions Kn * f is proved to converge to f in Lp[-ππ]. The pointwise and almost everywhere convergences are also consequences of our construction.

On the behaviour of zeros of Jacobi polynomials

Denote by x(n,k)(alpha, beta) and x(n,k) (lambda) = x(n,k) (lambda - 1/2, lambda - 1/2) the zeros, in decreasing order, of the Jacobi polynomial P-n((alpha, beta))(x) and of the ultraspherical (Gegenbauer) polynomial C-n(lambda)(x), respectively. The monotonicity of x(n,k)(alpha, beta) as functions of a and beta, alpha, beta > - 1, is investigated. Necessary conditions such that the zeros of P-n((a, b)) (x) are smaller (greater) than the zeros of P-n((alpha, beta))(x) are provided. A. Markov proved that x(n,k) (a, b) < x(n,k)(α, β) (x(n,k)(a, b) > x(n,k)(alpha, beta)) for every n is an element of N and each k, 1 less than or equal to k less than or equal to n if a > alpha and b < β (a < alpha and b > beta). We prove the converse statement of Markov's theorem. The question of how large the function could be such that the products f(n)(lambda) x(n,k)(lambda), k = 1,..., [n/2] are increasing functions of lambda, for lambda > - 1/2, is also discussed. Elbert and Siafarikas proved that f(n)(lambda) = (lambda + (2n(2) + 1)/ (4n + 2))(1/2) obeys this property. We establish the sharpness of their result. (C) 2002 Elsevier B.V. (USA).

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

Strong Grobner bases for polynomials over a principal ideal ring

Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.

Subspace wavepacket evolution with Newton polynomials

Time-dependent wavepacket evolution techniques demand the action of the propagator, exp(-iHt/(h)over-bar), on a suitable initial wavepacket. When a complex absorbing potential is added to the Hamiltonian for combating unwanted reflection effects, polynomial expansions of the propagator are selected on their ability to cope with non-Hermiticity. An efficient subspace implementation of the Newton polynomial expansion scheme that requires fewer dense matrix-vector multiplications than its grid-based counterpart has been devised. Performance improvements are illustrated with some benchmark one and two-dimensional examples. (C) 2001 Elsevier Science B.V. All rights reserved.

On the permutation behaviour of Dickson polynomials of the second kind

The known permutation behaviour of the Dickson polynomials of the second kind in characteristic 3 is expanded and simplified. (C) 2002 Elsevier Science (USA).

The compositional inverse of a class of permutation polynomials over a finite field

A new class of bilinear permutation polynomials was recently identified. In this note we determine the class of permutation polynomials which represents the functional inverse of the bilinear class.

On the requirements of interpolating polynomials for path motion constraints

In the framework of multibody dynamics, the path motion constraint enforces that a body follows a predefined curve being its rotations with respect to the curve moving frame also prescribed. The kinematic constraint formulation requires the evaluation of the fourth derivative of the curve with respect to its arc length. Regardless of the fact that higher order polynomials lead to unwanted curve oscillations, at least a fifth order polynomials is required to formulate this constraint. From the point of view of geometric control lower order polynomials are preferred. This work shows that for multibody dynamic formulations with dependent coordinates the use of cubic polynomials is possible, being the dynamic response similar to that obtained with higher order polynomials. The stabilization of the equations of motion, always required to control the constraint violations during long analysis periods due to the inherent numerical errors of the integration process, is enough to correct the error introduced by using a lower order polynomial interpolation and thus forfeiting the analytical requirement for higher order polynomials.

Recurrence relations for Clifford algebra-valued orthogonal polynomials

The theory of orthogonal polynomials of one real or complex variable is well established as well as its generalization for the multidimensional case. Hypercomplex function theory (or Clifford analysis) provides an alternative approach to deal with higher dimensions. In this context, we study systems of orthogonal polynomials of a hypercomplex variable with values in a Clifford algebra and prove some of their properties.

Ehrhart polynomials, successive minima, and an Ehrhart theory for rational dilates of a rational polytope

Magdeburg, Univ., Fak. für Mathematik, Diss., 2011