No label defined (Q4035561)
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 176409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 176409 |
Statements
18 May 1993
0 references
CRAY Y-MP
0 references
Encore Multimax
0 references
parallel Lanczos algorithm
0 references
shared-memory architectures
0 references
eigenpairs
0 references
eigenspectrum
0 references
generalized eigenvalue problem
0 references
multivector processor
0 references
parallel tridiagonal eigensolver
0 references
0.8901970982551575
0 references
0.8436561226844788
0 references
0.8313363790512085
0 references
0.8313363790512085
0 references
0.8267507553100586
0 references
[For the entire collection see Zbl 0753.00017.] The parallel Lanczos algorithm LANZ and its implementation on shared- memory architectures with a small to moderate number of processors is described to be used for finding a few of the eigenpairs around a point in the eigenspectrum. The generalized eigenvalue problem \(Kx=\lambda Mx\) \((K\), \(M\) are matrices; they are reordered to a narrow bandwidth) is considered. Two architectures, CRAY Y-MP and Encore Multimax are discussed. Differences in the implementation of the algorithm on a multivector processor and on a multiprocessor are pointed out. A model is presented for predicting the performance of LANZ in shared-memory architectures. Results from the implementation are given and analyzed by using an execution-time model. The algorithm and the parallel tridiagonal eigensolver are listed. The procedure is important for structural engineering where vibration and buckling arise.
0 references
