A connection between a generalized Pascal matrix and the hypergeometric function (Q1433202): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3844537 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The linear algebra of the Pascal matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stirling matrix via Pascal matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On solving linear systems of the Pascal type / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The linear algebra of the generalized Pascal matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4382605 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4382673 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0893-9659(03)90123-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1966608650 / rank | |||
Normal rank |
Latest revision as of 10:20, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A connection between a generalized Pascal matrix and the hypergeometric function |
scientific article |
Statements
A connection between a generalized Pascal matrix and the hypergeometric function (English)
0 references
15 June 2004
0 references
The authors consider the generalized Pascal matrix \(P\) and a lower triangular matrix \(L\) defined as follows, \[ [P(t)]_{ij} = {_2F_1} \left[1-i,1-j; 1;\frac{1}{t^2}\right]t^{i+j-2},\qquad [L(t)]_{ij}=\frac{(i-1)!t^{i-j}}{(j-1)!(i-j)!}\,. \] By elementary methods they establish the Cholesky decomposition \(P(t) = L(t)\) \(L{t}^T\). From one of Gauss' relations between contiguous functions, a recurrence relation for \(P(t)\) easily follows; this relation is then used to obtain an algorithm for computing the elements of \(P(t)\).
0 references
hypergeometric polynomials
0 references
Cholesky decomposition
0 references
Pascal matrix
0 references
hypergeometric function
0 references