Two connections between the \(SR\) and \(HR\) eigenvalue algorithms (Q1379102)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1116060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two connections between the \(SR\) and \(HR\) eigenvalue algorithms |
scientific article; zbMATH DE number 1116060 |
Statements
Two connections between the \(SR\) and \(HR\) eigenvalue algorithms (English)
0 references
31 March 1998
0 references
The authors study relations between \(SR\) and \(HR\) algorithms of decomposition type for the eigenvalue problem. They show that an \(SR\) iteration step on a symplectic butterfly matrix or \(J\)-tridiagonal Hamiltonian matrix with special shifts is equivalent to an \(HR\) iteration step on a tridiagonal sign-symmetric matrix with related shifts.
0 references
SR algorithm
0 references
HR algorithm
0 references
eigenvectors
0 references
\(J\)-tridiagonal Hamiltonian matrix
0 references
eigenvalue
0 references
iteration
0 references
symplectic butterfly matrix
0 references
tridiagonal sign-symmetric matrix
0 references
0 references
0 references
0.7960554957389832
0 references
0.7769875526428223
0 references
