2016
DOI: 10.1080/10652469.2015.1124876
|View full text |Cite
|
Sign up to set email alerts
|

On connection sequence for equivalent polynomial sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…where 0 ≤ i, j ≤ n. Suppose that s, t and v are triangular bases, α 1 (n, k) is the coefficient function for a change of basis matrix M ts and α 2 (n, k) is a coefficient function for M sv following equation (7). Then…”
Section: Definitions and Background Equationsmentioning
confidence: 99%
See 1 more Smart Citation
“…where 0 ≤ i, j ≤ n. Suppose that s, t and v are triangular bases, α 1 (n, k) is the coefficient function for a change of basis matrix M ts and α 2 (n, k) is a coefficient function for M sv following equation (7). Then…”
Section: Definitions and Background Equationsmentioning
confidence: 99%
“…Previous related work gives recurrence relations for finding connection coefficients for orthogonal polynomials, e.g., [14], for Jacobi polynomials [13], or by other methods [5,7] and for special cases [4,6].…”
Section: Introduction and Related Workmentioning
confidence: 99%