We express a weighted generalization of the Delannoy numbers in terms of shifted Jacobi polynomials. A specialization of our formulas extends a relation between the central Delannoy numbers and Legendre polynomials, observed over 50 years ago [12, 17, 19], to all Delannoy numbers and certain Jacobi polynomials. Another specialization provides a weighted lattice path enumeration model for shifte...

The most common approach for approximating non-periodic function defined on a finite interval is based on considering polynomials as basis functions. In this paper we will address the non-optimallity of polynomial approximation and suggest to switch from powers of x to powers of sin(px) where p is a parameter which depends on the dimension of the approximating subspace. The new set does not suf...

Orthogonal Legendre moments are used in several pattern recognition and image processing applications. Translation and scale Legendre moment invariants were expressed as a combination of the approximate original Legendre moments. The shifted and scaled Legendre polynomials were expressed in terms of the original Legendre polynomials according to complicated and time-consuming algebraic relation...

In this paper I propose to estimate distributions on the unit interval semi-nonparametrically using orthonormal Legendre polynomials. This approach will be applied to the interval censored mixed proportional hazard (ICMPH) model, where the distribution of the unobserved heterogeneity is modeled semi-nonparametrically. Various conditions for the nonparametric identification of the ICMPH model ar...

In this report, we present two mathematical results which can be useful in a variety of settings. First, we present an analysis of Legendre polynomials triple product integral. Such integrals arise whenever two functions are multiplied, with both the operands and the result represented in the Legendre polynomial basis. We derive a recurrence relation to calculate these integrals analytically. W...

Let be introduced the Sobolev-type inner product (f, g) = 1 2 Z 1 −1 f(x)g(x)dx + M [f ′(1)g′(1) + f ′(−1)g′(−1)], where M ≥ 0. In this paper we will prove that for 1 ≤ p ≤ 4 3 there are functions f ∈ L([−1, 1]) whose Fourier expansion in terms of the orthonormal polynomials with respect to the above Sobolev inner product are divergent almost everywhere on [−1, 1]. We also show that, for some v...

We describe a method for the numerical evaluation of normalized versions of the associated Legendre functions P−μ ν and Q −μ ν of degrees 0 ≤ ν ≤ 1, 000, 000 and orders −ν ≤ μ ≤ ν on the interval (−1, 1). Our algorithm, which runs in time independent of ν and μ, is based on the fact that while the associated Legendre functions themselves are extremely expensive to represent via polynomial expan...

The RK5GL3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on a combination of a fifth-order Runge-Kutta method and 3-point Gauss-Legendre quadrature. In this paper we describe an effective local error control algorithm for RK5GL3, which uses local extrapolation with an eighth-order Runge-Kutta method in tandem with RK5GL3, and a ...

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.