A two-step iterative block Lanczos algorithm for a dominant eigenspan (Q1094817)
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: A two-step iterative block Lanczos algorithm for a dominant eigenspan |
scientific article; zbMATH DE number 4026668
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-step iterative block Lanczos algorithm for a dominant eigenspan |
scientific article; zbMATH DE number 4026668 |
Statements
A two-step iterative block Lanczos algorithm for a dominant eigenspan (English)
0 references
1987
0 references
It is proposed that repeated application of two steps of the block Lanczos algorithm be used as an eigenvalue algorithm. This type of algorithm has been analysed by \textit{G. E. Forsythe} [Numer. Math. 11, 57- 76 (1968; Zbl 0153.460)] and advocated by \textit{J. Cullum} and coworkers [see e.g. BIT 18, 265-275 (1978; Zbl 0391.65013)]. The present contribution is mainly experimental, containing a series of numerical runs.
0 references
numerical example
0 references
block Lanczos algorithm
0 references
eigenvalue algorithm
0 references
