Abstract
Many important scientific and engineering problems require the computation of a small number of eigenvalues of large nonsymmetric matrices. The biorthogonal Lanczos method is one of the methods to solve that problem. In this paper, we introduce the s-step biorthogonal Lanczos method generating reduction matrices which are similar to reduction matrices generated by the standard biorthogonal Lanczos method. The s-step generalization of biorthogonal Lanczos method enhances parallel properties by forming s simultaneous search direction vectors. The s-step biorthogonal Lanczos method has the minimized synchronization points, which resulted in the minimized global communication compared to the standard biorthogonal Lanczos method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Golub, G.H., Van Loan, C.F.: MATRIX Computations. Johns Hopkins University Press (1996)
Kurzak, J., Alvaro, W., Dongarra, J.: Optimizing matrix multiplication for a short-vector SIMD architevture – CELL processor. Parallel Computing 35 (2009)
Kim, S.K., Chronopoulos, A.T.: A Class of Lanczos Algorithms Implemented on Parallel Computers. Parallel Computing 17, 763–778 (1991)
Parlett, B.N., Taylor, D.R., Liu, Z.A.: A lookahead algorithm for unsymmetric matrices. Math. Comp. 44, 105–124 (1985)
Saad, Y.: The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems. SIAM J. Numer. Anal. 19, 485–506 (1982)
Saad, Y.: Partial eigensolutions of large nonsymmetric matrices, Research Report YALUE/DCS/RR-397, Yale Univ. (1985)
Sim, L.C., Leedham, G., Jian, L.C., Schroder, H.: Fast solution of large N × N matrix equations in an MIMD-SIMD Hybrid System. Parallel Computing 29, 1669–1684 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S.K. (2010). Efficient Biorthogonal Lanczos Algorithm on Message Passing Parallel Computer. In: Hsu, CH., Malyshkin, V. (eds) Methods and Tools of Parallel Programming Multicomputers. MTPP 2010. Lecture Notes in Computer Science, vol 6083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14822-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-14822-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14821-7
Online ISBN: 978-3-642-14822-4
eBook Packages: Computer ScienceComputer Science (R0)