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.

A Characterization of L-orthogonal Polynomials from Three Term Recurrence Relations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Gaussian quadrature rules with simple node-weight relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.

Polynomials generated by a three term recurrence relation: bounds for complex zeros

This paper deals with the zeros of polynomials generated by a certain three term recurrence relation. The main objective is to find bounds, in terms of the coefficients of the recurrence relation, for the regions where the zeros are located. In most part, the zeros are explored through an Eigenvalue representation associated with a corresponding Hessenberg rnatrix. Applications to Szego polynomials, para-orthogonal polynomials and polynomials with non-zero complex coefficients are considered. (C) 2004 Elsevier B.V. All rights reserved.

Szego polynomials: some relations to L-orthogonal and orthogonal polynomials

We consider the real Szego polynomials and obtain some relations to certain self inversive orthogonal L-polynomials defined on the unit circle and corresponding symmetric orthogonal polynomials on real intervals. We also consider the polynomials obtained when the coefficients in the recurrence relations satisfied by the self inversive orthogonal L-polynomials are rotated. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Decay chain differential equations: Solution through matrix algebra

A matricial method to solve the decay chain differential equations system is presented. The quantity of each nuclide in the chain at a time t may be evaluated by analytical expressions obtained in a simple way using recurrence relations. This method may be applied to problems of radioactive buildup and decay and can be easily implemented computationally. (C) 2009 Elsevier B.V. All rights reserved.

Some concepts and models usefulninthe analysis of discrete life time data

This thesis entitled Reliability Modelling and Analysis in Discrete time Some Concepts and Models Useful in the Analysis of discrete life time data.The present study consists of five chapters. In Chapter II we take up the derivation of some general results useful in reliability modelling that involves two component mixtures. Expression for the failure rate, mean residual life and second moment of residual life of the mixture distributions in terms of the corresponding quantities in the component distributions are investigated. Some applications of these results are also pointed out. The role of the geometric,Waring and negative hypergeometric distributions as models of life lengths in the discrete time domain has been discussed already. While describing various reliability characteristics, it was found that they can be often considered as a class. The applicability of these models in single populations naturally extends to the case of populations composed of sub-populations making mixtures of these distributions worth investigating. Accordingly the general properties, various reliability characteristics and characterizations of these models are discussed in chapter III. Inference of parameters in mixture distribution is usually a difficult problem because the mass function of the mixture is a linear function of the component masses that makes manipulation of the likelihood equations, leastsquare function etc and the resulting computations.very difficult. We show that one of our characterizations help in inferring the parameters of the geometric mixture without involving computational hazards. As mentioned in the review of results in the previous sections, partial moments were not studied extensively in literature especially in the case of discrete distributions. Chapters IV and V deal with descending and ascending partial factorial moments. Apart from studying their properties, we prove characterizations of distributions by functional forms of partial moments and establish recurrence relations between successive moments for some well known families. It is further demonstrated that partial moments are equally efficient and convenient compared to many of the conventional tools to resolve practical problems in reliability modelling and analysis. The study concludes by indicating some new problems that surfaced during the course of the present investigation which could be the subject for a future work in this area.

Duplication coefficients via generating functions

In this paper, we solve the duplication problem P_n(ax) = sum_{m=0}^{n}C_m(n,a)P_m(x) where {P_n}_{n>=0} belongs to a wide class of polynomials, including the classical orthogonal polynomials (Hermite, Laguerre, Jacobi) as well as the classical discrete orthogonal polynomials (Charlier, Meixner, Krawtchouk) for the specific case a = −1. We give closed-form expressions as well as recurrence relations satisfied by the duplication coefficients.

Exercise sheet 9

Exercises and solutions in LaTex

Exercise sheet 9 pdf

Exercises and solutions in PDF

Synthesis of a systolic array genetic algorithm

The paper presents a design for a hardware genetic algorithm which uses a pipeline of systolic arrays. These arrays have been designed using systolic synthesis techniques which involve expressing the algorithm as a set of uniform recurrence relations. The final design divorces the fitness function evaluation from the hardware and can process chromosomes of different lengths, giving the design a generic quality. The paper demonstrates the design methodology by progressively re-writing a simple genetic algorithm, expressed in C code, into a form from which systolic structures can be deduced. This paper extends previous work by introducing a simplification to a previous systolic design for the genetic algorithm. The simplification results in the removal of 2N 2 + 4N cells and reduces the time complexity by 3N + 1 cycles.

Density profiles in the raise and peel model with and without a wall; physics and combinatorics

We consider the raise and peel model of a one-dimensional fluctuating interface in the presence of an attractive wall. The model can also describe a pair annihilation process in disordered unquenched media with a source at one end of the system. For the stationary states, several density profiles are studied using Monte Carlo simulations. We point out a deep connection between some profiles seen in the presence of the wall and in its absence. Our results are discussed in the context of conformal invariance ( c = 0 theory). We discover some unexpected values for the critical exponents, which are obtained using combinatorial methods. We have solved known ( Pascal`s hexagon) and new (split-hexagon) bilinear recurrence relations. The solutions of these equations are interesting in their own right since they give information on certain classes of alternating sign matrices.

Rational approximations of the Arrhenius integral using Jacobi fractions and gaussian quadrature

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

THE STRONG C-SYMMETRICAL DISTRIBUTION

In this paper, we consider a class of strong symmetric distributions, which we refer to as the strong c-symmetric distributions. We provide, as the main result of this paper, conditions satisfied by the recurrence relations of certain polynomials associated with these distributions.

SYMMETRICAL ORTHOGONAL POLYNOMIALS AND THE ASSOCIATED ORTHOGONAL L-POLYNOMIALS

We show how symmetric orthogonal polynomials can be linked to polynomials associated with certain orthogonal L-polynomials. We provide some examples to illustrate the results obtained Finally as an application, we derive information regarding the orthogonal polynomials associated with the weight function (1 + kx(2))(1 - x(2))(-1/2), k > 0.