An efficient nonsymmetric Lanczos method on parallel vector computers (Q1200180): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587874 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
Normal rank | |||
Revision as of 12:15, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient nonsymmetric Lanczos method on parallel vector computers |
scientific article |
Statements
An efficient nonsymmetric Lanczos method on parallel vector computers (English)
0 references
17 January 1993
0 references
The purpose is to reduce the number of synchronization points, when executing the nonsymmetric Lanczos algorithm on a shared memory parallel computer. This is effected by doing the same operations as in \(s\)-step look ahead Lanczos every \(s\)-th iteration. Break down can then occur only every \(s\)-th step, and running time gets shorter on an \(s\)-processor parallel Cray2 computer.
0 references
biorthogonal
0 references
\(s\)-step
0 references
breakdown
0 references
conditions reduction
0 references
nonsymmetric Lanczos algorithm
0 references
shared memory parallel computer
0 references
