Abstract
In this paper, the performance of the five kinds of parallel reorthogonalization methods by using the Gram-Schmidt (G-S) method is reported. Parallelization of the re-orthogonalization process depends on the implementation of G-S orthogonalization process, i.e. Classical G-S (CG-S) and Modified G-S (MG-S). To relax the parallelization problem, we propose a new hybrid method by using both the CG-S and MG-S. The HITACHI SR8000/MPP of 128 PEs, which is a distributed memory super-computer, is used in this performance evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Balay, W. Gropp, L. C. McInnes, and B. Smith. Petsc 2.0 users manual, 1995. ANL-95/11-Revision 2.0.24, http://www-fp.mcs.anl.gov/petsc/. 309
C. Bischof and C. van Loan. The wy representation for products of householder matrices. SIAM J. Sci. Stat. Comput., 8(1):s2–s13, 1987. 302
J.W. Demmel. Applied Numerical Linear Algebra. SIAM, 1997. 302
J. J. Dongarra, I. S. Du., D.C. Sorensen, and H.A. van der Vorst. Numerical Linear Algebra for High-Performance Computers. SIAM, 1998. 302
J. J. Dongarra and R.A. van de Geijn. Reduction to condensed form for the eigenvalue problem on distributed memory architectures. Parallel Computing, 18:973–982, 1992. 302
B.A. Hendrickson and D.E. Womble. The tours-wrap mapping for dense matrix calculation on massively parallel computers. SIAM Sci. Comput., 15(5):1201–1226, 1994. 302
T. Katagiri. A study on parallel implementation of large scale eigenproblem solver for distributed memory architecture parallel machines. Master’s Degree Thesis, the Department of Information Science, the University of Tokyo, 1998. 302
T. Katagiri. A study on large scale eigensolvers for distributed memory parallel machines. Ph.D Thesis, the Department of Information Science, the University of Tokyo, 2000. 302, 303, 304
T. Katagiri and Y. Kanada. An efficient implementation of parallel eigenvalue computation for massively parallel processing. Parallel Computing, 27:1831–1845, 2001. 309
B.N. Parlett. The Symmetric Eigenvalue Problem. SIAM, 1997. 302, 308, 309
G.W. Stewart. Matrix Algorithms Volume II:Eigensystems. SIAM, 2001. 302
D. Vanderstraeten. A parallel block gram-schmidt algorithm with controlled loss of orthogonality. Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999. 302
Y. Yamamoto, M. Igai, and K. Naono. A new algorithm for accurate computation of eigenvectors on shared-memory parallel processors. Proceedings of Joint Symposium on Parallel Processing (JSPP)’2000, pages 19–26, 2000. in Japanese. 302
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katagiri, T. (2003). Performance Evaluation of Parallel Gram-Schmidt Re-orthogonalization Methods. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds) High Performance Computing for Computational Science — VECPAR 2002. VECPAR 2002. Lecture Notes in Computer Science, vol 2565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36569-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-36569-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00852-1
Online ISBN: 978-3-540-36569-3
eBook Packages: Springer Book Archive