• Title/Summary/Keyword: Preconditioned Conjugate Gradient Method

Search Result 39, Processing Time 0.028 seconds

Diffusion synthetic acceleration with the fine mesh rebalance of the subcell balance method with tetrahedral meshes for SN transport calculations

  • Muhammad, Habib;Hong, Ser Gi
    • Nuclear Engineering and Technology
    • /
    • v.52 no.3
    • /
    • pp.485-498
    • /
    • 2020
  • A diffusion synthetic acceleration (DSA) technique for the SN transport equation discretized with the linear discontinuous expansion method with subcell balance (LDEM-SCB) on unstructured tetrahedral meshes is presented. The LDEM-SCB scheme solves the transport equation with the discrete ordinates method by using the subcell balances and linear discontinuous expansion of the flux. Discretized DSA equations are derived by consistently discretizing the continuous diffusion equation with the LDEM-SCB method, however, the discretized diffusion equations are not fully consistent with the discretized transport equations. In addition, a fine mesh rebalance (FMR) method is devised to accelerate the discretized diffusion equation coupled with the preconditioned conjugate gradient (CG) method. The DSA method is applied to various test problems to show its effectiveness in speeding up the iterative convergence of the transport equation. The results show that the DSA method gives small spectral radii for the tetrahedral meshes having various minimum aspect ratios even in highly scattering dominant mediums for the homogeneous test problems. The numerical tests for the homogeneous and heterogeneous problems show that DSA with FMR (with preconditioned CG) gives significantly higher speedups and robustness than the one with the Gauss-Seidel-like iteration.

Aggregation multigrid method for schur complement system in FE analysis of continuum elements

  • Ko, Jin-Hwan;Lee, Byung Chai
    • Structural Engineering and Mechanics
    • /
    • v.30 no.4
    • /
    • pp.467-480
    • /
    • 2008
  • An aggregation multigrid method (AMM) is a leading iterative solver in solid mechanics. Recently, AMM is applied for solving Schur Complement system in the FE analysis of shell structures. In this work, an extended application of AMM for solving Schur Complement system in the FE analysis of continuum elements is presented. Further, the performance of the proposed AMM in multiple load cases, which is a challenging problem for an iterative solver, is studied. The proposed method is developed by combining the substructuring and the multigrid methods. The substructuring method avoids factorizing the full-size matrix of an original system and the multigrid method gives near-optimal convergence. This method is demonstrated for the FE analysis of several elastostatic problems. The numerical results show better performance by the proposed method as compared to the preconditioned conjugate gradient method. The smaller computational cost for the iterative procedure of the proposed method gives a good alternative to a direct solver in large systems with multiple load cases.

A STUDY OF SPECTRAL ELEMENT METHOD FOR ELLIPTIC INTERFACE PROBLEMS WITH NONSMOOTH SOLUTIONS IN ℝ2

  • KUMAR, N. KISHORE;BISWAS, PANKAJ;REDDY, B. SESHADRI
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.3_4
    • /
    • pp.311-334
    • /
    • 2020
  • The solution of the elliptic partial differential equation has interface singularity at the points which are either the intersections of interfaces or the intersections of interfaces with the boundary of the domain. The singularities that arises in the elliptic interface problems are very complex. In this article we propose an exponentially accurate nonconforming spectral element method for these problems based on [7, 18]. A geometric mesh is used in the neighbourhood of the singularities and the auxiliary map of the form z = ln ξ is introduced to remove the singularities. The method is essentially a least-squares method and the solution can be obtained by solving the normal equations using the preconditioned conjugate gradient method (PCGM) without computing the mass and stiffness matrices. Numerical examples are presented to show the exponential accuracy of the method.

Warm-Start of Interior Point Methods for Multicommodity Network Flow Problem (다수상품 유통문제를 위한 내부점 방법에서의 Warm-Start)

  • 임성묵;이상욱;박순달
    • Korean Management Science Review
    • /
    • v.21 no.1
    • /
    • pp.77-86
    • /
    • 2004
  • In this paper, we present a methodology for solving the multicommodity network flow problems using interior point methods. In our method, the minimum cost network flow problem extracted from the given multicommodity network flow problem is solved by primal-dual barrier method in which normal equations are solved partially using preconditioned conjugate gradient method. Based on the solution of the minimum cost network flow problem, a warm-start point is obtained from which Castro's specialized interior point method for multicommodity network flow problem starts. In the computational experiments, the effectiveness of our methodology is shown.

Comparison of PCGM Algorithms for Mild Slope Equation (완경사 파랑식에 대한 PCGM 연산방식 비교)

  • 서승남
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.6 no.2
    • /
    • pp.186-195
    • /
    • 1994
  • In order to make an accurate and fast numerical method based on Preconditioned Conjugate Gradient Method(PCGM), several methods are presented including the exising method such as Bayliss or at. (1983) or Panchang et al. (1991). The results of the methods are compared with the analytical linear solution of plane waves over a constant depth. After advantages and disadvanteges of the methods are discussed. both accuracy and convergence of them are analyzed. The method developed in the paper is proved. by means of tests. to be the best method to solve the mild slope equation numerically.

  • PDF

A Spectral-Galerkin Nodal Method for Salving the Two-Dimensional Multigroup Diffusion Equations

  • Hongwu Cheng;Cho, Nam-Zin
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1996.05a
    • /
    • pp.157-162
    • /
    • 1996
  • A novel nodal method is developed for the two-dimensional multi-group diffusion equations based on the Spectral-Galerkin approach. In this study, the nodal diffusion equations with Robin boundary condition are reformulated in a weak (variational) form, which is then approximated spatially by choosing appropriate basis functions. For the nodal coupling relations between the neighbouring nodes, the continuity conditions of partial currents are utilized. The resulting discrete systems with sparse structured matrices are solved by the Preconditioned Conjugate Gradient Method (PCG) and sweeping technique. The method is validated on two test problems.

  • PDF

A Study for Spectral Properties of Preconditioner of Symmetric Toeplitz Systems (대칭 토플리츠 시스템의 선행조건에 대한 특정성질 연구)

  • Baik, Ran
    • Journal of Digital Contents Society
    • /
    • v.10 no.4
    • /
    • pp.579-585
    • /
    • 2009
  • In [9], Tyrtshnikov proposed a preconditioned approach to derive a general solution from a Toeplitz linear system. Furthermore, the process of selecting a preconditioner matrix from symmetric Toeplitz matrix, which has been used in previous studies, is introduced. This research introduces a new method for finding the preconditioner in a Toeplitz system. Also, through analyzing these preconditioners, it is derived that eigenvalues of a symmetric Toeplitz are very close to eigenvalues of a new preconditioner for T. It is shown that if the spectrum of the preconditioned system $C_0^{-1}T$ is clustered around 1, then the convergence rate of the preconditioned system is superlinear. From these results, it is determined to get the superliner at the convergence rate by our good preconditioner $C_0$. Moreover, an advantage is driven by increasing various applications i. e. image processing, signal processing, etc. in this study from the proposed preconditioners for Toeplitz matrices. Another characteristic, which this research holds, is that the preconditioner retains the properties of the Toeplitz matrix.

  • PDF

A Numerical Model of PCGM for Mild Slope Equation (완경사 파랑식에 대한 PCGM 수치모형)

  • 서승남;연영진
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.6 no.2
    • /
    • pp.164-173
    • /
    • 1994
  • A numerical model to solve mild slope equation is developed by use of a preconditioned conjugate gradient method (PCGM). In the present paper. accurate boundary conditions and a better preconditioner are employed which are improved from the existing method of Panchang et al. (1991). Computational procedures are focused on weakly nonlinear waves, and emerged problems to make a more accurate model are discussed. The results of model are tested against laboratory results of both circular and elliptic shoals. Model results of wave amplitude show excellent agreement with laboratory data and thes thus model can be used as a powerful tool to calculate wave transformation in shallow waters with complex bathymetry.

  • PDF

Parallel Processing of 3D Rigid-Plastic FEM on a Cluster System (클러스터 시스템에서 3차원 강소성 유한요소법의 병렬처리)

  • Choi Young;Seo Yongwie
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.22 no.1
    • /
    • pp.122-129
    • /
    • 2005
  • On the cluster system, the parallel code of rigid-plastic FEM has been developed. The cluster system, Simforge, has 15 processors and the total memory is 4.5GBytes. In the developed parallel code, the distributed data of the column-wise partitioned stiffness are stored as the compressed row storage and the diagonal preconditioned conjugate gradient solver is applied. The analysis of block upsetting is performed with the parallel code on Simforge cluster system. In this paper, the analysis results are compared and discussed.

PCG Algorithms for Development of PC level Parallel Structural Analysis Method (PC level 병렬 구조해석법 개발을 위한 PCG 알고리즘)

  • 박효선;박성무;권윤한
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.10a
    • /
    • pp.362-369
    • /
    • 1998
  • The computational environment in which engineers perform their designs has been rapidly evolved from coarse serial machines to massively parallel machines. Although the recent development of high-performance computers are available for a number of years, only limited successful applications of the new computational environments in computational structural engineering field has been reported due to its limited availability and large cost associated with high-performance computing. As a new computational model for high-performance engineering computing without cost and availability problems, parallel structural analysis models for large scale structures on a network of personal computers (PCs) are presented in this paper. In structural analysis solving routine for the linear system of equations is the most time consuming part. Thus, the focus is on the development of efficient preconditioned conjugate gradient (PCG) solvers on the proposed computational model. Two parallel PCG solvers, PPCG-I and PPCG-II, are developed and applied to analysis of large scale space truss structures.

  • PDF