An efficient nonsymmetric Lanczos method on parallel vector computers
- 1 October 1992
- journal article
- research article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 42 (3) , 357-374
- https://doi.org/10.1016/0377-0427(92)90085-c
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A class of Lanczos-like algorithms implemented on parallel computersParallel Computing, 1991
- Krylov Subspace Methods on SupercomputersSIAM Journal on Scientific and Statistical Computing, 1989
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchyParallel Computing, 1989
- s-step iterative methods for symmetric linear systemsJournal of Computational and Applied Mathematics, 1989
- Leapfrog variants of iterative methods for linear algebraic equationsJournal of Computational and Applied Mathematics, 1988
- Sparse matrix calculations on the CRAY-2Parallel Computing, 1987
- The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor SystemsIEEE Transactions on Computers, 1987
- Data parallel algorithmsCommunications of the ACM, 1986
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric SystemsSIAM Journal on Numerical Analysis, 1982
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matricesLinear Algebra and its Applications, 1980