The generalized Lilbert matrix (Q1677555): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10998-016-0128-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2335851095 / rank | |||
Normal rank |
Revision as of 22:33, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The generalized Lilbert matrix |
scientific article |
Statements
The generalized Lilbert matrix (English)
0 references
10 November 2017
0 references
In the paper, the concept of a Lilbert matrix (titled after the names of F. E. A. Lucas and D. Hilbert) is introduced. Its entries have the form \[ t_{i,j} = \frac{1}{L_{\lambda(i+j)+r}L_{\lambda(i+j+1)+r} \dots L_{\lambda(i+j+k-1)+r}}, \] where \(r \geq -1\) and \(\lambda \geq 1\) are integer parameters. \smallskip Let for any square matrix \(A\), a decomposition \(A = LU\) be called a \(LU\)-decomposition of \(A\), if \(L\) is a unit lower triangular matrix and \(U\) is an upper triangular matrix. \smallskip Explicit formulas are derived for the elements of the \(LU\)-decomposition, for their inverses, and for other decompositions.
0 references
Lilbert matrix
0 references
Filbert matrix
0 references
Pilbert matrix
0 references
Fibonacci numbers
0 references
\(q\)-Analogues
0 references
\(LU\)-decomposition
0 references
Cholesky decomposition
0 references
Zeilberger's algorithm
0 references