An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems.
A divide-and-conquer method for computing eigenvalues and eigenvectors of a block-tridiagonal matrix with rank-one off-diagonal blocks is presented. The implications of unbalanced merging operations due to unequal block sizes are analyzed and illustrated with numerical examples. It is shown that an...
| Pubblicato in: | ACM transactions on mathematical software. 28, 1 (2002). |
|---|---|
| Autore principale: | |
| Altri autori: | , |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |