An efficient nonsymmetric Lanczos method on parallel vector computers

DOI10.1016/0377-0427(92)90085-CzbMath0756.65057MaRDI QIDQ1200180

S. Singh

Publication date: 17 January 1993

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

breakdown; biorthogonal; \(s\)-step; nonsymmetric Lanczos algorithm; shared memory parallel computer; conditions reduction

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

65Y05: Parallel numerical computation

Related Items

On the squared unsymmetric Lanczos method, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse matrix calculations on the CRAY-2
• Leapfrog variants of iterative methods for linear algebraic equations
• s-step iterative methods for symmetric linear systems
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• A class of Lanczos-like algorithms implemented on parallel computers
• On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
• Krylov Subspace Methods on Supercomputers
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems