An efficient nonsymmetric Lanczos method on parallel vector computers

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

S. Singh

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-0427(92)90085-c

zbMATH Keywords

breakdownbiorthogonal\(s\)-stepnonsymmetric Lanczos algorithmshared memory parallel computerconditions reduction

Mathematics Subject Classification ID

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

Related Items

On the squared unsymmetric Lanczos method, The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR, A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences, Avoiding Communication in Primal and Dual Block Coordinate Descent Methods, Varying the \(s\) in your \(s\)-step GMRES, On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems, Communication lower bounds and optimal algorithms for numerical linear algebra, A Numerical Method to Solve Nonsymmetric Eigensystems Applied to Dynamics of Turbomachinery, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision

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