Extraction of orthogonal polynomials from generating function for reciprocal of odd numbers

In the present paper the orthogonality relations, exhibited by both numerator and denominator polynomials of both even and odd order convergents of a regular C-fraction of a power series with coefficients as reciprocal of odd numbers are described. The two sequences of convergents are nothing but diagonal and upper diagonal Pade approximants for the power series. The two orthogonal polynomials extracted from denominators are shown to be classical orthogonal polynomials and two orthogonal polynomials extracted from numerators are shown to be non-classical orthogonal polynomials..     

Pseudo-Orthogonal Polynomials

We consider the classical problem of transforming an orthogonality weight of polynomials by means of the space R _n . We describe systems of polynomials called pseudo-orthogonal on a finite set of n points. Like orthogonal polynomials, the polynomials of these systems are connected by three-term relations with tridiagonal matrix which is nondecomposable but does not enjoy the Jacobi property. Nevertheless these polynomials possess real roots of multiplicity one; moreover, almost all roots of two neighboring polynomials separate one another. The pseudo-orthogonality weights are partly negative. Another result is the analysis of relations between matrices of two different orthogonal systems which enables us to give explicit conditions for existence of pseudo-orthogonal polynomials.     

Operations over scalar polynomials and their computer realization

In this paper, algorithms which realize some operations over scalar polynomials in one and two variables and their computer realization are suggested. The following operations are considered: 1) the computation of the GCD for given scalar polynomials and the decomposition of each polynomial into a product of two factors: the first factor is the GCD, and the second factors form a sequence of relatively prime polynomials; 2) the division of polynomials by their common divisor; 3) the decomposition of polynomials in two variables into irreducible factors; 4) the computation of the LCM for given scalar polynomials. Bibliography: 5 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 219, 1994, pp. 158–175. This work was supported by the Russian Foundation of Fundamental Research (grant 94-01-00919). Translated by V. N. Kublanovskaya.     

四元数体上两类多项式的零点

本文研究四元数体 Q上多项式的零点 ,特别对于其中两类多项式——系数两两可换的多项式和二次多项式建立了系统而完善的零点理论 .     

Two-variable orthogonal polynomials of big q-Jacobi type

A four-parameter family of orthogonal polynomials in two discrete variables is defined for a weight function of basic hypergeometric type. The polynomials, which are expressed in terms of univariate big q-Jacobi polynomials, form an extension of Dunkl’s bivariate (little) q-Jacobi polynomials [C.F. Dunkl, Orthogonal polynomials in two variables of q-Hahn and q-Jacobi type, SIAM J. Algebr. Discrete Methods 1 (1980) 137-151]. We prove orthogonality property of the new polynomials, and show that they satisfy a three-term relation in a vector-matrix notation, as well as a second-order partial q-difference equation.     

A basic class of symmetric orthogonal polynomials using the extended Sturm-Liouville theorem for symmetric functions

In this research, by applying the extended Sturm-Liouville theorem for symmetric functions, a basic class of symmetric orthogonal polynomials (BCSOP) with four free parameters is introduced and all its standard properties, such as a generic second order differential equation along with its explicit polynomial solution, a generic orthogonality relation, a generic three term recurrence relation and so on, are presented. Then, it is shown that four main sequences of symmetric orthogonal polynomials can essentially be extracted from the introduced class. They are respectively the generalized ultraspherical polynomials, generalized Hermite polynomials and two other sequences of symmetric polynomials, which are finitely orthogonal on (−∞,∞) and can be expressed in terms of the mentioned class directly. In this way, two half-trigonometric sequences of orthogonal polynomials, as special sub-cases of BCSOP, are also introduced.     

Integral representations for the generalized Bedient polynomials and the generalized Cesàro polynomials

The main object of this paper is to investigate several general families of hypergeometric polynomials and their associated multiple integral representations. By suitably specializing our main results, the corresponding integral representations are deduced for such familiar classes of hypergeometric polynomials as (for example) the generalized Bedient polynomials and the generalized Cesàro polynomials. Each of the integral representations, which are derived in this paper, may be viewed also as a linearization relationship for the product of two different members of the associated family of hypergeometric polynomials.     

Bilinear Generating Functions for Orthogonal Polynomials

Using realizations of the positive discrete series representations of the Lie algebra su(1,1) in terms of Meixner—Pollaczek polynomials, the action of su(1,1) on Poisson kernels of these polynomials is considered. In the tensor product of two such representations, two sets of eigenfunctions of a certain operator can be considered and they are shown to be related through continuous Hahn polynomials. As a result, a bilinear generating function for continuous Hahn polynomials is obtained involving the Poisson kernel of Meixner—Pollaczek polynomials; this result is also known as the Burchnall—Chaundy formula. For the positive discrete series representations of the quantized universal enveloping algebra U _q (su(1,1)) a similar analysis is performed and leads to a bilinear generating function for Askey—Wilson polynomials involving the Poisson kernel of Al-Salam and Chihara polynomials. July 6, 1997. Date accepted: September 23, 1998.     

Peters type polynomials and numbers and their generating functions: Approach with p‐adic integral method

The aim of this paper is to introduce and investigate some of the primary generalizations and unifications of the Peters polynomials and numbers by means of convenient generating functions and p‐adic integrals method. Various fundamental properties of these polynomials and numbers involving some explicit series and integral representations in terms of the generalized Stirling numbers, generalized harmonic sums, and some well‐known special numbers and polynomials are presented. By using p‐adic integrals, we construct generating functions for Peters type polynomials and numbers (Apostol‐type Peters numbers and polynomials). By using these functions with their partial derivative eqautions and functional equations, we derive many properties, relations, explicit formulas, and identities including the Apostol‐Bernoulli polynomials, the Apostol‐Euler polynomials, the Boole polynomials, the Bernoulli polynomials, and numbers of the second kind, generalized harmonic sums. A brief revealing and historical information for the Peters type polynomials are given. Some of the formulas given in this article are given critiques and comments between previously well‐known formulas. Finally, two open problems for interpolation functions for Apostol‐type Peters numbers and polynomials are revealed.     

The Symmetric Fourth Painlevé Hierarchy and Associated Special Polynomials

In this paper two families of rational solutions and associated special polynomials for the equations in the symmetric fourth Painlevé hierarchy are studied. The structure of the roots of these polynomials is shown to be highly regular in the complex plane. Further representations are given of the associated special polynomials in terms of Schur functions. The properties of these polynomials are compared and contrasted with the special polynomials associated with rational solutions of the fourth Painlevé equation.     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Matrix Pearson Equations Satisfied by Koornwinder Weights in Two Variables

We consider Koornwinder’s method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder’s construction generates semiclassical orthogonal polynomials in two variables. We consider two methods for deducing matrix Pearson equations for weight functions associated with these polynomials, and consequently, we deduce the second order linear partial differential operators for classical Koornwinder polynomials.     

On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method

In this paper we explore two sets of polynomials, the orthogonal polynomials and the residual polynomials, associated with a preconditioned conjugate gradient iteration for the solution of the linear system Ax = b. In the context of preconditioning by the matrix C, we show that the roots of the orthogonal polynomials, also known as generalized Ritz values, are the eigenvalues of an orthogonal section of the matrix C A while the roots of the residual polynomials, also known as pseudo-Ritz values (or roots of kernel polynomials), are the reciprocals of the eigenvalues of an orthogonal section of the matrix (C A)^?1. When C A is selfadjoint positive definite, this distinction is minimal, but for the indefinite or nonselfadjoint case this distinction becomes important. We use these two sets of roots to form possibly nonconvex regions in the complex plane that describe the spectrum of C A.     

Christoffel-Darboux-type formulae and a recurrence for biorthogonal polynomials

It is proved that biorthogonal polynomials obey two different kinds of Christoffel-Darboux-type formulae, one linking polynomials with a different parameter and one combining polynomials with different degrees. This is used to produce a mixed recurrence relation, which is valid for all biorthogonal polynomials. This recurrence relation establishes several results on interlacing property of zeros of successive biorthogonal polynomials and leads to a new result on the interlace of zeros of orthogonal polynomials (of equal degrees) with respect to two distributionsdψ(x) andx ^p dψ(x), 0<p≤1, with support in either [0, 1] or [1, ∞).     

Orthogonal polynomials and laurent polynomials related to the Hahn-Extonq-Bessel function

Laurent polynomials related to the Hahn-Extonq-Bessel function, which areq-analogues of the Lommel polynomials, have been introduced by Koelink and Swarttouw. The explicit strong moment functional with respect to which the Laurentq-Lommel polynomials are orthogonal is given. The strong moment functional gives rise to two positive definite moment functionals. For the corresponding sets of orthogonal polynomials, the orthogonality measure is determined using the three-term recurrence relation as a starting point. The relation between Chebyshev polynomials of the second kind and the Laurentq-Lommel polynomials and related functions is used to obtain estimates for the latter.     

Generalized n-gons and Chebychev polynomials

Two sequences of orthogonal polynomials are given whose weight functions consist of an absolutely continuous part and two point masses. Combinatorial proofs of the orthogonality relations are given. The polynomials include natural q-analogs of the Chebychev polynomials. The technique uses association schemes of generalized n-gons to find approximating discrete orthogonality relations. The Feit-Higman Theorem is a corollary of these orthogonality relations for the polynomials.     

Euler Pseudoprime Polynomials and Strong Pseudoprime Polynomials

It is usual to emphasize the analogy between the integers and polynomials with coefficients in a finite field, comparing different notions in the two points of view. We introduce a particular rank one Drinfeld module to get an exponentiation for polynomials and then define the notions of Euler pseudoprimes and strong pseudoprimes for polynomials with coefficients in a finite field. As for the integers, we have Solovay–Strassen and Miller–Rabin tests for polynomials.     

On sequences of Hurwitz polynomials related to orthogonal polynomials

ABSTRACT

In this contribution, we explore the well-known connection between Hurwitz and orthogonal polynomials. Namely, given a Hurwitz polynomial, it is shown that it can be decomposed into two parts: a polynomial that is orthogonal with respect to some positive measure supported in the positive real axis and its corresponding second-kind polynomial. Conversely, given a sequence of orthogonal polynomials with respect to a positive measure supported in the positive real axis, a sequence of Hurwitz polynomials can be constructed. Based on that connection, we construct sequences of Hurwitz polynomials that satisfy a recurrence relation, in a similar way as the orthogonal polynomials do. Even more, we present a way to construct families of Hurwitz polynomials using two sequences of parameters and a recurrence relation that constitutes an analogue of Favard's theorem in the theory of orthogonal polynomials.     

GPBi‐CGstab(L): A Lanczos‐type product method unifying Bi‐CGstab(L) and GPBi‐CG

Lanczos‐type product methods (LTPMs), in which the residuals are defined by the product of stabilizing polynomials and the Bi‐CG residuals, are effective iterative solvers for large sparse nonsymmetric linear systems. Bi‐CGstab(L) and GPBi‐CG are popular LTPMs and can be viewed as two different generalizations of other typical methods, such as CGS, Bi‐CGSTAB, and Bi‐CGStab2. Bi‐CGstab(L) uses stabilizing polynomials of degree L, while GPBi‐CG uses polynomials given by a three‐term recurrence (or equivalently, a coupled two‐term recurrence) modeled after the Lanczos residual polynomials. Therefore, Bi‐CGstab(L) and GPBi‐CG have different aspects of generalization as a framework of LTPMs. In the present paper, we propose novel stabilizing polynomials, which combine the above two types of polynomials. The resulting method is referred to as GPBi‐CGstab(L). Numerical experiments demonstrate that our presented method is more effective than conventional LTPMs.