Results 41 to 50 of about 73,122 (279)
Surface Smoothing based on Discrete Orthogonal Polynomial
CAD'24Lei Lu, Ning Li, Wei Pan, Wenming Tang
openalex +2 more sources
Discrete transforms and orthogonal polynomials of (anti)symmetric multivariate cosine functions
, 2014 The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to the ...
Hrivnák, Jiří, Motlochová, Lenka
core +1 more source
A Discrete Approach to Monotonicity of Zeros of Orthogonal Polynomials [PDF]
Transactions of the American Mathematical Society, 1991 We study the monotonicity with respect to a parameter of zeros of orthogonal polynomials. Our method uses the tridiagonal (Jacobi) matrices arising from the three-term recurrence relation for the polynomials. We obtain new results on monotonicity of zeros of associated Laguerre, Al-Salam-Carlitz, Meixner and Pollaczek polynomials.
Martin E. Muldoon, Mourad E. H. Ismail
openaire +2 more sources
Variations of Stieltjes-Wigert and q-Laguerre polynomials and their recurrence coefficients
, 2014 We look at some extensions of the Stieltjes-Wigert weight functions. First we replace the variable x by x^2 in a family of weight functions given by Askey in 1989 and we show that the recurrence coefficients of the corresponding orthogonal polynomials ...
Boelen, Lies, Van Assche, Walter
core +1 more source
Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials
IEEE Access, 2023 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
New Characterizations of Discrete Classical Orthogonal Polynomials
Journal of Approximation Theory, 1997 AbstractWe prove that if both {Pn(x)}∞n=0and {∇rPn(x)}∞n=rare orthogonal polynomials for any fixed integer r⩾1, then {Pn(x)}∞n=0must be discrete classical orthogonal polynomials. This result is a discrete version of the classical Hahn's theorem stating that if both {Pn(x)}∞n=0and {(d/dx)rPn(x)}∞n=rare orthogonal polynomials, then {Pn(x)}∞n=0are ...
Kwon, KH Kwon, Kil Hyun +2 more
openaire +3 more sources
Orthogonal Polynomials in Mathematical Physics
, 2017 This is a review of ($q$-)hypergeometric orthogonal polynomials and their relation to representation theory of quantum groups, to matrix models, to integrable theory, and to knot theory.
Chan, Chuan-Tsung +3 more
core +1 more source
Stable Calculation of Krawtchouk Functions from Triplet Relations
Mathematics, 2021 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
A characterization of the classical orthogonal discrete and q-polynomials
Journal of Computational and Applied Mathematics, 2007 In this paper we present a new characterization for the classical discrete and q-classical (discrete) polynomials (in the Hahn's sense).
Alfaro García, Manuel +1 more
openaire +3 more sources
Zeros of classical orthogonal polynomials of a discrete variable [PDF]
Mathematics of Computation, 2012 In this paper we obtain sharp bounds for the zeros of classical orthogonal polynomials of a discrete variable, considered as functions of a parameter, by using a theorem of A. Markov and the so-called HellmannFeynman theorem. Comparisons with previous results for zeros of Hahn, Meixner, Kravchuk and Charlier polynomials are also presented.
Area, Ivan +3 more
openaire +4 more sources