A class of Lanczos-like algorithms implemented on parallel computers

DOI10.1016/S0167-8191(05)80065-1zbMath0735.65016MaRDI QIDQ1179222

S. Singh

Publication date: 26 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

performancenumerical examplessparse matrixparallel implementationLanczos algorithmextreme eigenvaluessymmetric matriceshypercube computerCRAY-2s-step method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR, Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers, A PARALLEL BLOCK LANCZOS ALGORITHM FOR DISTRIBUTED MEMORY ARCHITECTURES, MONITORING THE CONVERGENCE OF THE LANCZOS ALGORITHM IN PARALLEL COMPUTING ENVIRONMENTS, The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures, An efficient nonsymmetric Lanczos method on parallel vector computers, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision, RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES