Inversion, Multiplication and Connection Formulae of Classical Continuous Orthogonal Polynomials

In this paper, we consider multiplication formulas and their inversion formulas for Hurwitz–Lerch zeta functions. Inversion formulas give simple proofs of known results, and also show generalizations of those results. Next, we give a generalization of digamma and gamma functions in terms of Hurwitz–Lerch zeta functions, and consider its properties. In all the sections, various results are always proved by multiplication and inversion formulas.

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z 2/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.

In this paper using both analytic and algorithmic approaches, we derive the coefficients \(D_m(n,a)\) of the multiplication formula $$\begin{aligned} p_n(ax)=\sum _{m=0}^nD_m(n,a)p_m(x) \end{aligned}$$ or the translation formula $$\begin{aligned} p_n(x+a)=\sum _{m=0}^nD_m(n,a)p_m(x), \end{aligned}$$ where \(\{p_n\}_{n\ge 0}\) is an orthogonal polynomial set, including the classical continuous orthogonal polynomials, the classical discrete orthogonal polynomials, the \(q\)-classical orthogonal polynomials, as well as the classical orthogonal polynomials on a quadratic lattice and a \(q\)-quadratic lattice. We give a representation of the coefficients \(D_m(n,a)\) as a single, double or triple sum whereas in many cases we get simple representations.

We solve the problem of finding the inverse connection formulae for the generalised Bessel polynomials and their reciprocals, the reverse generalised Bessel polynomials. The connection formulae express monomials in terms of the generalised Bessel polynomials. They enable formulae for the elements of change of basis matrices for both kinds of generalised Bessel polynomials to be derived and proved correct directly.

From the study of various properties of some difference operators, we prove in the first part of this work that the continuous Hahn and the Meixner–Pollaczek polynomials are solutions of a second-order divided-difference equation of hypergeometric- type. Next, using some algorithmic tools, we solve the inversion, connection, multiplication and linearization problems for the continuous Hahn and the Meixner–Pollaczek polynomials.

In this paper, we consider three-way split formulas for binary polynomial multiplication and Toeplitz matrix vector product (TMVP). We first recall the best known three-way split formulas for polynomial multiplication: the formulas with six recursive multiplications given by Sunar in a 2006 IEEE Transactions on Computers paper and the formula with five recursive multiplications proposed by Bernstein at CRYPTO 2009. Second, we propose a new set of three-way split formulas for polynomial multiplication that are an optimization of Sunar's formulas. Then, we present formulas with five recursive multiplications based on field extension. In addition, we extend the latter formulas to TMVP. We evaluate the space and delay complexities when computations are performed in parallel and provide a comparison with best known methods.

This paper investigates a class of Jacobsthal-type polynomials (JTPs) that involves one parameter. We present several new formulas for these polynomials, including expressions for their derivatives, moments, and linearization formulas. The key idea behind the derivation of these formulas is based on developing a new connection formula that expresses the shifted Chebyshev polynomials of the third kind in terms of the JTPs. This connection formula is used to deduce a new inversion formula of the JTPs. Therefore, by utilizing the power form representation of these polynomials and their corresponding inversion formula, we can derive additional expressions for them. Additionally, we compute some definite integrals based on some formulas of these polynomials.

The present paper conduct to introduce the connection and duplication formulas associated with the Boas-Buck-Appell polynomials. Examples providing the analogues results for certain members related to the Boas-Buck-Appell polynomials are considered.

Connection coefficients between Boas–Buck polynomial sets

&lt;abstract&gt;&lt;p&gt;This paper presents a new approach for the unified Chebyshev polynomials (UCPs). It is first necessary to introduce the three basic formulas of these polynomials, namely analytic form, moments, and inversion formulas, which will later be utilized to derive further formulas of the UCPs. We will prove the basic formula that shows that these polynomials can be expressed as a combination of three consecutive terms of Chebyshev polynomials (CPs) of the second kind. New derivatives and connection formulas between two different classes of the UCPs are established. Some other expressions of the derivatives of UCPs are given in terms of other orthogonal and non-orthogonal polynomials. The UCPs are also the basis for additional derivative expressions of well-known polynomials. A new linearization formula (LF) of the UCPs that generalizes some well-known formulas is given in a simplified form where no hypergeometric forms are present. Other product formulas of the UCPs with various polynomials are also given. As an application to some of the derived formulas, some definite and weighted definite integrals are computed in closed forms.&lt;/p&gt;&lt;/abstract&gt;

On Jacobi functions and multiplication theorems for integrals of Bessel functions

In this paper Geronimus transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is given in terms of a nondegenerate continuous sesquilinear form, which in turn is determined by a quasidefinite matrix of bivariate generalized functions with a well defined support. The discussion of the orthogonality for such a sesquilinear form includes, among others, matrix Hankel cases with linear functionals, general matrix Sobolev orthogonality and discrete orthogonal polynomials with an infinite support. The results are mainly concerned with the derivation of Christoffel type formulas, which allow to express the perturbed matrix biorthogonal polynomials and its norms in terms of the original ones. The basic tool is the Gauss–Borel factorization of the Gram matrix, and particular attention is paid to the non-associative character, in general, of the product of semi-infinite matrices. The Geronimus transformation, in where a right multiplication by the inverse of a matrix polynomial and an addition of adequate masses is performed, is considered. The resolvent matrix and connection formulas are given. Two different methods are developed. A spectral one, based on the spectral properties of the perturbing polynomial, and constructed in terms of the second kind functions. This approach requires the perturbing matrix polynomial to have a nonsingular leading term. Then, using spectral techniques and spectral jets, Christoffel–Geronimus formulas for the transformed polynomials and norms are presented. For this type of transformations, the paper also proposes an alternative method, which does not require of spectral techniques, that is valid also for singular leading coefficients. When the leading term is nonsingular a comparative of between both methods is presented. The nonspectral method is applied to unimodular Christoffel perturbations, and a simple example for a degree one massless Geronimus perturbation is given.

In this paper, Geronimus transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is given in terms of a nondegenerate continuous sesquilinear form, which in turn is determined by a quasi-definite matrix of bivariate generalized functions with a well-defined support. The discussion of the orthogonality for such a sesquilinear form includes, among others, matrix Hankel cases with linear functionals, general matrix Sobolev orthogonality and discrete orthogonal polynomials with an infinite support. The results are mainly concerned with the derivation of Christoffel-type formulas, which allow to express the perturbed matrix biorthogonal polynomials and its norms in terms of the original ones. The basic tool is the Gauss–Borel factorization of the Gram matrix, and particular attention is paid to the non-associative character, in general, of the product of semi-infinite matrices. The Geronimus transformation in which a right multiplication by the inverse of a matrix polynomial and an addition of adequate masses are performed, is considered. The resolvent matrix and connection formulas are given. Two different methods are developed. A spectral one, based on the spectral properties of the perturbing polynomial, and constructed in terms of the second kind functions. This approach requires the perturbing matrix polynomial to have a nonsingular leading term. Then, using spectral techniques and spectral jets, Christoffel–Geronimus formulas for the transformed polynomials and norms are presented. For this type of transformations, the paper also proposes an alternative method, which does not require of spectral techniques, that is valid also for singular leading coefficients. When the leading term is nonsingular, a comparison of between both methods is presented. The nonspectral method is applied to unimodular Christoffel perturbations, and a simple example for a degree one massless Geronimus perturbation is given.

Efficient polynomial multiplication formulae are required for cryptographic computation. From elliptic curve cryptography to homomorphic encryption, many cryptographic systems need efficient multiplication formulae. The most widely used multiplication formulae for cryptographic systems are the Karatsuba-like polynomial multiplication formulae. In this paper, these formulae and Montgomery’s work yielding more efficient such formulae are introduced. Moreover, recent efforts to improve these results are discussed by presenting associated techniques. The state of art for this area is also discussed.

Classical orthogonal polynomials (Hermite, Laguerre, Jacobi and Bessel) constitute the most important families of orthogonal polynomials. They appear in mathematical physics when Sturn-Liouville problems for hypergeometric differential equation are studied. These families of orthogonal polynomials have specific properties. Our main aim is to: 1. recall the definition of classical continuous orthogonal polynomials; 2. prove the orthogonality of the sequence of the derivatives; 3. prove that each element of the classical orthogonal polynomial sequence satisfies a second-order linear homogeneous differential equation; 4. give the Rodrigues formula. KeywordsClassical orthogonal polynomialsRodrigues formulaDifferential equationPearson type equationMathematics Subject Classification (2000)33C4533D45