A class of Lanczos-like algorithms implemented on parallel computers
From MaRDI portal
Publication:1179222
DOI10.1016/S0167-8191(05)80065-1zbMath0735.65016MaRDI QIDQ1179222
Publication date: 26 June 1992
Published in: Parallel Computing (Search for Journal in Brave)
performance; numerical examples; sparse matrix; parallel implementation; Lanczos algorithm; extreme eigenvalues; symmetric matrices; hypercube computer; CRAY-2; s-step method
65F50: Computational methods for sparse matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
Related Items
The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures, An efficient nonsymmetric Lanczos method on parallel vector computers, Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers