Results 41 to 50 of about 61,972 (313)
On zeros of discrete orthogonal polynomials
The authors establish sharp inequalities for the extreme zeros of the classical discrete orthogonal polynomials: Charlier, Krawtchouk, Meixner, and Hahn. Their approach is based on the corresponding difference equations. For Charlier, Krawtchouk, and Meixner polynomials the function bounding the zero spacing is unimodal, meanwhile for the Hahn case ...
Krasikov, Ilia, Zarkh, Alexander
openaire +3 more sources
On the analytic form of the discrete Kramer sampling theorem
The classical Kramer sampling theorem is, in the subject of self-adjoint boundary value problems, one of the richest sources to obtain sampling expansions. It has become very fruitful in connection with discrete Sturm-Liouville problems.
Antonio G. García +2 more
doaj +1 more source
A Probablistic Origin for a New Class of Bivariate Polynomials
We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the discovery of an ...
Michael R. Hoare, Mizan Rahman
doaj +1 more source
Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials
Discrete Racah polynomials (DRPs) are highly efficient orthogonal polynomials and used in various scientific fields for signal representation. They find applications in disciplines like image processing and computer vision.
Basheera M. Mahmmod +4 more
doaj +1 more source
Exactly solvable discrete quantum mechanical systems and multi-indexed orthogonal polynomials of the continuous Hahn and Meixner–Pollaczek types [PDF]
We present new exactly solvable systems of the discrete quantum mechanics with pure imaginary shifts, whose physical range of the coordinate is the whole real line.
S. Odake
semanticscholar +1 more source
Some discrete d-orthogonal polynomial sets
The concept of \(d\)-orthogonality has been received quite a lot of attention over the last ten years and the authors give a very interesting contribution to the development of the field. Let \(u\) be a linear functional on the space \textbf{P} of all polynomials; its action is written as \(\langle u,f\rangle\) for all \(f\in\mathbf{P}\).
Ben Cheikh, Yousséf, Zaghouani, Ali
openaire +1 more source
Stable Calculation of Krawtchouk Functions from Triplet Relations
Deployment of the recurrence relation or difference equation to generate discrete classical orthogonal polynomials is vulnerable to error propagation. This issue is addressed for the case of Krawtchouk functions, i.e., the orthonormal basis derived from ...
Albertus C. den Brinker
doaj +1 more source
On Generating Orthogonal Polynomials for Discrete Measures
In the present paper, we derive an algorithm for computing the recurrence coefficients of orthogonal polynomials with respect to discrete measures. This means that the support of the measure is a finite set. The algorithm is based oniormulae of Nevai describing the transformation of recurrence coefficients, if we add a point mass to the measure of ...
openaire +3 more sources
New Characterizations of Discrete Classical Orthogonal Polynomials
In this very nice paper, the authors consider (quasi)orthogonal polynomial sequences [\((Q)OPS\): see (i)] with respect to a regular moment functional \(\sigma\) [see (ii)]. (i) \(\{P_n\}_{n=0}^{\infty}\) polynomials in \(x\) with degree \(P_n=n,\;n\geq 0\) form a \(QOPS\) resp. \(OPS\) if \(\langle \sigma,P_nP_m\rangle = K_n\delta_{nm}\) with \(K_n\in{
Kwon, KH Kwon, Kil Hyun +2 more
openaire +3 more sources
Discrete orthogonal polynomials associated with Macdonald functions
New sequences of discrete orthogonal polynomials associated with the modified Bessel function $K_ (z)$ or Macdonald function are considered. The corresponding weight function is $ ^k _{k+ +1}(t)/ k!$, where $\ k \in \mathbb{N}_0, \ t \ge 0,\ > -1,\ 0 < < 1,\ _ (z) = 2 z^{ /2} K_ \left( 2\sqrt z\right)$.
openaire +3 more sources

