PERFORMANCE ENHANCEMENT OF PARALLEL MULTIFRONTAL SOLVER ON BLOCK LANCZOS METHOD

  • Byun, Wan-Il (SCHOOL OF MECHANICAL AND AEROSPACE ENG, SEOUL NATIONAL UNIV) ;
  • Kim, Seung-Jo (SCHOOL OF MECHANICAL AND AEROSPACE ENG, SEOUL NATIONAL UNIV)
  • Received : 2008.12.29
  • Accepted : 2009.02.20
  • Published : 2009.03.25

Abstract

The IPSAP which is a finite element analysis program has been developed for high parallel performance computing. This program consists of various analysis modules - stress, vibration and thermal analysis module, etc. The M orthogonal block Lanczos algorithm with shiftinvert transformation is used for solving eigenvalue problems in the vibration module. And the multifrontal algorithm which is one of the most efficient direct linear equation solvers is applied to factorization and triangular system solving phases in this block Lanczos iteration routine. In this study, the performance enhancement procedures of the IPSAP are composed of the following stages: 1) communication volume minimization of the factorization phase by modifying parallel matrix subroutines. 2) idling time minimization in triangular system solving phase by partial inverse of the frontal matrix and the LCM (least common multiple) concept.

References

  1. D. Calvetti, L. Reichel and D. Sorensen, "An Implicit Restarted Lanczos Method for Large Symmetric Eigenvalue Problems," Electronic Transaction on Numerical Analysis, Vol. 2, pp. 1-21, 1994
  2. K. Wu and H. Simon, "An Evaluation of the Parallel Shift-and-Invert Lanczos Method," Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 2913-2919, Las Vegas USA, June 1999
  3. R. Morgan and D. Scott, "Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems," SIAM Journal on Scientific Computing, Vol. 14, pp. 585-593, 1993 https://doi.org/10.1137/0914037
  4. Y.T. Feng and D.R.J. Owen, "Conjugate Gradient Methods for Solving the Smallest Eigenpair of Large Symmetric Eigenvalue Problems," International Journal for Numerical Methods in Engineering, Vol. 39, pp. 2209-2229, 1996 https://doi.org/10.1002/(SICI)1097-0207(19960715)39:13<2209::AID-NME951>3.0.CO;2-R
  5. http://www.netlib.org/blas
  6. http://www.netlib.org/lapack
  7. Choi, J., "A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers", Proceedings of the IPPS, pp. 310-314, 1997