\(qd\) block algorithm (Q608503)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(qd\) block algorithm |
scientific article; zbMATH DE number 5819662
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(qd\) block algorithm |
scientific article; zbMATH DE number 5819662 |
Statements
\(qd\) block algorithm (English)
0 references
25 November 2010
0 references
The authors consider the block \(qd\) algorithm for block tridiagonal positive definite symmetric matrices, where the blocks are \(\ell \times \ell\) matrices. It is shown that the eigenvalues \(\lambda_i^{(k)}\), \(k \in N\), of the first block on the block diagonal of the decomposition obtained in the \(k\)th step of the \(qd\) algorithm constitute for all \(i=1,2, \dots, \ell\) a strictly increasing sequence, i.e.~\(\lambda_i^{(k)} < \lambda_i^{(k+1)}\), \(k \in N\). The eigenvalues of the last block constitute a strictly decreasing sequence. Furthermore, the convergence of the block \(qd\) algorithm is proved.
0 references
block \(qd\) algorithm
0 references
matrix three term recurrence relation
0 references
matrix orthogonal polynomial
0 references
Jacobi matrix
0 references
block \(LR\) algorithm
0 references
eigenvalues
0 references
block tridiagonal positive definite symmetric matrix
0 references
convergence
0 references
0 references
0 references
0.8530396
0 references
0 references
0.8375026
0 references
0.8361887
0 references
0 references
0 references
0.8321193
0 references
0 references