Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

COMPARISONS OF PARALLEL PRECONDITIONERS FOR THE COMPUTATION OF SMALLEST GENERALIZED EIGENVALUE

  • 발행 : 2003.01.01

⟨ 이전 논문 다음 논문 ⟩

초록

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.

키워드

참고문헌

  1. Numer. Math. v.9 New iterative methods for the solution the eigenproblem W. W. BRADBURY;R. RLETCHER
  2. Comput. Struct. v.58 A multi-mesh, preconditioned conjugate gradient solver for eigenvalue problems in finite element models Y. Cho;Y. K. Yong
  3. Ph. D. Thesis Iterative methods for lage, sparse, nonsymmetric systems of linear equations H. Elman
  4. Internat. J. Numer. Methods Engrg. v.39 Conjugate gradient methods for solving the smallest eigenpair of large summetric eigenvalue problems Y. T. Rfng;D. R. J. Owen
  5. SIAM J. Sci. Comput. v.16 Nested iterations for symmetric eigenproblems G. Gambolati;G. Pini;M. Putti
  6. Comput. Methods Appl. Mech. Engrg. v.94 An orthogonal accelerated deflation technique for large symmetric eigenproblems G. Gambolati;F. Sartoretto;P. Elorian
  7. SIAM J. Sci. Stat v.11 Tow-color Fourier analysis of iterative algorithm for elliptic problems with red/back ordering C. -C. Jay Kuo;Tony Chan
  8. International Journal of High Speed Computing v.10 Comparison of the parallel preconditioners on the CRAY-T3E for large nonsymmertic linear systems Sangback M. A.
  9. Mathematica Computation v.31 An iterative solution method for linear systems of which the coeffcient matrix is a sysmmetric M-matrix J. A. Meijerink;H. A. Van Der Vorst
  10. The Symmetric Eigenvalue Problem B. N. Parlett
  11. Spares Matrix Techniques Computation of eigenvolue and eigenvuctors A. Ruhe;V. A. Baker(ed.)
  12. Recent Advaces in Iterative Methods, IMA Volumes in Mathematics and its Applications v.60 Highly parallel preconditioner for general sparse matrices Y. Saad;G. Golub(eds.);M. Luskin(eds.);A. Greenbaum(eds.)
  13. MIAM J. Sci. Stat v.10 Krylov subspace methods in supercomputers Y. Saad
  14. J. Comput. Phys. v.81 Accelerated simultaneous iterations for large finite element eigemproblems F. Sartoretto;G. Pini;G. Gambolati
  15. ISNM v.96 Eigenvalue problems and preconditioning H. R. Schwarz