2015
DOI: 10.1016/j.cam.2014.11.022
|View full text |Cite
|
Sign up to set email alerts
|

Bivariate Krawtchouk polynomials: Inversion and connection problems with the NAVIMA algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…(see e.g. [1,2,8,13,24,32]). In particular, a general method, based on operational rules and generating functions, was developed for polynomial sets with equivalent lowering operators and with Boas-Buck generating functions [6,12,14].…”
Section: Introductionmentioning
confidence: 99%
“…(see e.g. [1,2,8,13,24,32]). In particular, a general method, based on operational rules and generating functions, was developed for polynomial sets with equivalent lowering operators and with Boas-Buck generating functions [6,12,14].…”
Section: Introductionmentioning
confidence: 99%
“…The interest of having these new orthogonal polynomial families is not only theoretical. Since they do satisfy a partial differential equation it might be possible to consider orthogonal polynomial expansions of related partial differential equations by considering, e.g., the so-called Navima algorithm [7,13], to get numerical approximations for the solutions to other partial differential equations.…”
Section: Introductionmentioning
confidence: 99%
“…In fact, the literature on this subject is vast and a wide variety of methods have been developed using several techniques. Here, we refer mainly to the following references [1,2,3,8,11,24,30,31,49,50,56]. Zeros of orthogonal polynomials is another widely discussed subject due to its applications in several problems of applied sciences [54] and their crucial role in quadrature formulas [22].…”
Section: Introductionmentioning
confidence: 99%