• 제목/요약/키워드: preconditioners

검색결과 43건 처리시간 0.029초

레이레이 계수의 최소화에 의한 내부고유치 계산을 위한 병렬준비행렬들의 비교 (Comparisons of Parallel Preconditioners for the Computation of Interior Eigenvalues by the Minimization of Rayleigh Quotient)

  • 마상백;장호종
    • 정보처리학회논문지A
    • /
    • 제10A권2호
    • /
    • pp.137-140
    • /
    • 2003
  • 최근에 CG 반복법을 이용하여 레이레이 계수를 최소화함으로써 대칭행렬의 내부고유치를 구하는 방법이 개발되었다 그리고 이 방법은 병렬계산에 매우 적합하다. 적절한 준비행렬의 선택은 수렴속도를 향상시킨다. 우리는 본 연구에서 이를 위한 병렬준비행렬들을 비교한다. 고려된 준비행렬들은 Point-SSOR, 다중색채하의 ILU(0)와 Block SSOR이다. 우리는 128개의 노드를 가진 CRAY-T3E에서 구현하였다. 프로세서간의 통신은 MPI 리이브러리를 사용하였다. 최고 512$\times$512 행렬까지 시험하였는데 이 행렬들은 타원형 편미분방정식의 근사화에서 얻어졌다. 그 결과 다중색채 Block SSOR이 가장 성능이 우수한 것으로 판명되었다.

PRECONDITIONED ITERATIVE METHOD FOR PETROV-GALERKIN PROCEDURE

  • Chung, Seiyoung;Oh, Seyoung
    • 충청수학회지
    • /
    • 제10권1호
    • /
    • pp.57-70
    • /
    • 1997
  • In this paper two preconditioned GMRES and QMR methods are applied to the non-Hermitian system from the Petrov-Galerkin procedure for the Poisson equation and compared to each other. To our purpose the ILUT and the SSOR preconditioners are used.

  • PDF

AN ASSESSMENT OF PARALLEL PRECONDITIONERS FOR THE INTERIOR SPARSE GENERALIZED EIGENVALUE PROBLEMS BY CG-TYPE METHODS ON AN IBM REGATTA MACHINE

  • Ma, Sang-Back;Jang, Ho-Jong
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.435-443
    • /
    • 2007
  • Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.

다중 격자 Navier-Stokes 해석을 위한 수렴 특성 연구 : II. 내재적 예조건자 (Convergence Study of the Multigrid Navier-Stokes Simulation : II. Implicit Preconditioners)

  • 김윤식;권장혁
    • 한국항공우주학회지
    • /
    • 제32권6호
    • /
    • pp.1-8
    • /
    • 2004
  • 본 연구는 다중 격자 Navier-Stokes 방정식 해석의 수렴성 향상을 그 목적으로 한다. 다중 격자 기법의 성능 향상을 위해 최근 많이 사용되고 있는 예조건화된 다단계 시간 전진 기법의 효율성 향상을 위한 연구를 수행하였다. 압축성 유동장 해석시 자주 이용되는 ADI 예조건자와 DDADI 예조건자의 수렴 특성 비교 연구를 수행하였다. 2차원 압축성 난류 유동장 해석에 적용함으로써 DDADI 예조건자가 ADI 예조건자에 비해 우수한 수렴특성을 가짐을 확인하였고, 이를 통하여 Fourier 해석을 통한 예조건화 특성 연구와 일치하는 수렴 특성을 확인하였다. Spalart-Allmaras(S-A) 난류 모델과 Baldwin-Lomax (B-L) 난류 모델의 적용을 통해 난류 모델에 따른 수렴성 비교를 수행하였다.

이산화된 Navier-Stokes 방정식의 영역분할법을 위한 병렬 예조건화 (Parallel Preconditioner for the Domain Decomposition Method of the Discretized Navier-Stokes Equation)

  • 최형권;유정열;강성우
    • 대한기계학회논문집B
    • /
    • 제27권6호
    • /
    • pp.753-765
    • /
    • 2003
  • A finite element code for the numerical solution of the Navier-Stokes equation is parallelized by vertex-oriented domain decomposition. To accelerate the convergence of iterative solvers like conjugate gradient method, parallel block ILU, iterative block ILU, and distributed ILU methods are tested as parallel preconditioners. The effectiveness of the algorithms has been investigated when P1P1 finite element discretization is used for the parallel solution of the Navier-Stokes equation. Two-dimensional and three-dimensional Laplace equations are calculated to estimate the speedup of the preconditioners. Calculation domain is partitioned by one- and multi-dimensional partitioning methods in structured grid and by METIS library in unstructured grid. For the domain-decomposed parallel computation of the Navier-Stokes equation, we have solved three-dimensional lid-driven cavity and natural convection problems in a cube as benchmark problems using a parallelized fractional 4-step finite element method. The speedup for each parallel preconditioning method is to be compared using upto 64 processors.

CONVERGENCE AND BREAKDOWN STUDY OF KRYLOV METHODS FOR NONSYMMETRIC LINEAR SYSTEMS

  • Yun, Jae-Heon
    • 대한수학회논문집
    • /
    • 제10권4호
    • /
    • pp.981-995
    • /
    • 1995
  • This paper first establishes some conditions for preconditioner under which PGCR does not break down. Next, VPGCR algorithm whose preconditioners can be easily obtained is introduced and then its breakdown and convergence properties are discussed. Lastly, implementation details of VPGCR are described and then numerical results of VPGCR with a certain criterion guaranteeing no breakdown are compared with those of restarted GMRES.

  • PDF

PERFORMANCE OF Gℓ-PCG METHOD FOR IMAGE DENOISING PROBLEMS

  • YUN, JAE HEON
    • Journal of applied mathematics & informatics
    • /
    • 제35권3_4호
    • /
    • pp.399-411
    • /
    • 2017
  • We first provide the linear operator equations corresponding to the Tikhonov regularization image denoising problems with different regularization terms, and then we propose how to choose Kronecker product preconditioners which are required for accelerating the $G{\ell}$-PCG method. Next, we provide how to apply the $G{\ell}$-PCG method with Kronecker product preconditioner to the linear operator equations. Lastly, we provide numerical experiments for image denoisng problems to evaluate the effectiveness of the $G{\ell}$-PCG with Kronecker product preconditioner.

Performance analysis of a flexible restarted fom(k) algorithm

  • Yun, Jae-Heon
    • 대한수학회보
    • /
    • 제34권4호
    • /
    • pp.667-678
    • /
    • 1997
  • This paper contains a convergence analysis of a flexible restarted FOM(k)(FFOM(k)), and its performance is compared with FGMRES(k). Performances of these two algorithms with variable preconditioners are also compared with those of preconditioned FOM(k) and GMRES(k). Numerical experiments show that FFOM(k) performs as well as, or better than for some problems, FGMRES(k).

  • PDF

다중 격자 Navier-Stokes 해석을 위한 예조건화된 다단계 시간 전진 기법 (Preconditioned Multistage time stepping for the Multigrid Navier-Stokes Solver)

  • 김윤식;권장혁;최윤호;이승수
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2002년도 춘계 학술대회논문집
    • /
    • pp.59-64
    • /
    • 2002
  • In this paper, the preconditioned multistage time stepping methods which are popular multigrid smoothers is implemented for the compressible Navier-Stokes calculation with full-coarsening multigrid method. The convergence characteristic of the point-Jacobi and Alternating direction line Jacobi(DDADI) preconditioners are studied. The performance of 2nd order upwind numerical fluxes such as 2nd order upwind TVD scheme and MUSCL-type linear reconstruction scheme are compared in the inviscid and viscous turbulent flow caculations.

  • PDF