• Title/Summary/Keyword: iterative solver

Search Result 47, Processing Time 0.026 seconds

High Performance Hybrid Direct-Iterative Solution Method for Large Scale Structural Analysis Problems

  • Kim, Min-Ki;Kim, Seung-Jo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.9 no.2
    • /
    • pp.79-86
    • /
    • 2008
  • High performance direct-iterative hybrid linear solver for large scale finite element problem is developed. Direct solution method is robust but difficult to parallelize, whereas iterative solution method is opposite for direct method. Therefore, combining two solution methods is desired to get both high performance parallel efficiency and numerical robustness for large scale structural analysis problems. Hybrid method mentioned in this paper is based on FETI-DP (Finite Element Tearing and Interconnecting-Dual Primal method) which has good parallel scalability and efficiency. It is suitable for fourth and second order finite element elliptic problems including structural analysis problems. We are using the hybrid concept of theses two solution method categories, combining the multifrontal solver into FETI-DP based iterative solver. Hybrid solver is implemented for our general structural analysis code, IPSAP.

An efficient adaptive finite element method based on EBE-PCG iterative solver for LEFM analysis

  • Hearunyakij, Manat;Phongthanapanich, Sutthisak
    • Structural Engineering and Mechanics
    • /
    • v.83 no.3
    • /
    • pp.353-361
    • /
    • 2022
  • Linear Elastic Fracture Mechanics (LEFM) has been developed by applying stress analysis to determine the stress intensity factor (SIF, K). The finite element method (FEM) is widely used as a standard tool for evaluating the SIF for various crack configurations. The prediction accuracy can be achieved by applying an adaptive Delaunay triangulation combined with a FEM. The solution can be solved using either direct or iterative solvers. This work adopts the element-by-element preconditioned conjugate gradient (EBE-PCG) iterative solver into an adaptive FEM to solve the solution to heal problem size constraints that exist when direct solution techniques are applied. It can avoid the formation of a global stiffness matrix of a finite element model. Several numerical experiments reveal that the present method is simple, fast, and efficient compared to conventional sparse direct solvers. The optimum convergence criterion for two-dimensional LEFM analysis is studied. In this paper, four sample problems of a two-edge cracked plate, a center cracked plate, a single-edge cracked plate, and a compact tension specimen is used to evaluate the accuracy of the prediction of the SIF values. Finally, the efficiency of the present iterative solver is summarized by comparing the computational time for all cases.

Computational Efficiency on Frequency Domain Analysis of Large-scale Finite Element Model by Combination of Iterative and Direct Sparse Solver (반복-직접 희소 솔버 조합에 의한 대규모 유한요소 모델의 주파수 영역 해석의 계산 효율)

  • Cho, Jeong-Rae;Cho, Keunhee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.32 no.2
    • /
    • pp.117-124
    • /
    • 2019
  • Parallel sparse solvers are essential for solving large-scale finite element models. This paper introduces the combination of iterative and direct solver that can be applied efficiently to problems that require continuous solution for a subtly changing sequence of systems of equations. The iterative-direct sparse solver combination technique, proposed and implemented in the parallel sparse solver package, PARDISO, means that iterative sparse solver is applied for the newly updated linear system, but it uses the direct sparse solver's factorization of previous system matrix as a preconditioner. If the solution does not converge until the preset iterations, the solution will be sought by the direct sparse solver, and the last factorization results will be used as a preconditioner for subsequent updated system of equations. In this study, an improved method that sets the maximum number of iterations dynamically at the first Krylov iteration step is proposed and verified thereby enhancing calculation efficiency by the frequency domain analysis.

Out-of-plane elastic buckling of truss beams

  • Fedoroff, Alexis;Kouhia, Reijo
    • Structural Engineering and Mechanics
    • /
    • v.45 no.5
    • /
    • pp.613-629
    • /
    • 2013
  • In this article we will present a method to directly evaluate the critical point of a non-linear system by using the solution of a polynomial eigenvalue approximation as a starting point for an iterative non-linear system solver. This method will be used to evaluate out-of-plane buckling properties of truss structures for which the lateral displacement of the upper chord has been prevented. The aim is to assess for a number of example structures whether or not the linearized eigenvalue solution gives a relevant starting point for an iterative non-linear system solver in order to find the minimum positive critical load.

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.

Finite Element Analysis of Shape Rolling Process using Destributive Parallel Algorithms on Cray T3E (병렬 컴퓨터를 이용한 형상 압연공정 유한요소 해석의 분산병렬처리에 관한 연구)

  • Gwon, Gi-Chan;Yun, Seong-Gi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.5 s.176
    • /
    • pp.1215-1230
    • /
    • 2000
  • Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

A fast adaptive numerical solver for nonseparable elliptic partial differential equations

  • Lee, June-Yub
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.1
    • /
    • pp.27-39
    • /
    • 1998
  • We describe a fast numerical method for non-separable elliptic equations in self-adjoin form on irregular adaptive domains. One of the most successful results in numerical PDE is developing rapid elliptic solvers for separable EPDEs, for example, Fourier transformation methods for Poisson problem on a square, however, it is known that there is no rapid elliptic solvers capable of solving a general nonseparable problems. It is the purpose of this paper to present an iterative solver for linear EPDEs in self-adjoint form. The scheme discussed in this paper solves a given non-separable equation using a sequence of solutions of Poisson equations, therefore, the most important key for such a method is having a good Poison solver. High performance is achieved by using a fast high-order adaptive Poisson solver which requires only about 500 floating point operations per gridpoint in order to obtain machine precision for both the computed solution and its partial derivatives. A few numerical examples have been presented.

  • PDF

Accelerating Numerical Analysis of Reynolds Equation Using Graphic Processing Units (그래픽처리장치를 이용한 레이놀즈 방정식의 수치 해석 가속화)

  • Myung, Hun-Joo;Kang, Ji-Hoon;Oh, Kwang-Jin
    • Tribology and Lubricants
    • /
    • v.28 no.4
    • /
    • pp.160-166
    • /
    • 2012
  • This paper presents a Reynolds equation solver for hydrostatic gas bearings, implemented to run on graphics processing units (GPUs). The original analysis code for the central processing unit (CPU) was modified for the GPU by using the compute unified device architecture (CUDA). The red-black Gauss-Seidel (RBGS) algorithm was employed instead of the original Gauss-Seidel algorithm for the iterative pressure solver, because the latter has data dependency between neighboring nodes. The implemented GPU program was tested on the nVidia GTX580 system and compared to the original CPU program on the AMD Llano system. In the iterative pressure calculation, the implemented GPU program showed 20-100 times faster performance than the original CPU codes. Comparison of the wall-clock times including all of pre/post processing codes showed that the GPU codes still delivered 4-12 times faster performance than the CPU code for our target problem.

Efficient 3D Modeling of CSEM Data (인공송신원 전자탐사 자료의 효율적인 3차원 모델링)

  • Jeong, Yong-Hyeon;Son, Jeong-Sul;Lee, Tae-Jong
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2009.10a
    • /
    • pp.75-80
    • /
    • 2009
  • Despite its flexibility to complex geometry, three-dimensional (3D) electromagnetic(EM) modeling schemes using finite element method (FEM) have been faced to practical limitation due to the resulting large system of equations to be solved. An efficient 3D FEM modeling scheme has been developed, which can adopt either direct or iterative solver depending on the problems. The direct solver PARDISO can reduce the computing time remarkably by incorporating parallel computing on multi-core processor systems, which is appropriate for single frequency multi-source configurations. When limited memory, the iterative solver BiCGSTAB(1) can provide fast and stable convergence. Efficient 3D simulations can be performed by choosing an optimum solver depending on the computing environment and the problems to be solved. This modeling includes various types of controlled-sources and can be exploited as an efficient engine for 3D inversion.

  • PDF

The Iterated Ritz Method: Basis, implementation and further development

  • Dvornik, Josip;Lazarevic, Damir;Uros, Mario;Novak, Marta Savor
    • Coupled systems mechanics
    • /
    • v.7 no.6
    • /
    • pp.755-774
    • /
    • 2018
  • The Ritz method is known as very successful strategy for discretizing continuous problems, but it has never been used for solving systems of algebraic equations. The Iterated Ritz Method (IRM) is a novel iterative solver based on the discretized Ritz procedure applied at each iteration step. With an appropriate choice of coordinate vectors, the method may be efficient in linear, nonlinear and optimization problems. Additionally, some iterative methods can be explained as special cases of this approach, which helps to understand advantages and limitations of these methods and gives motivation for their improvement in sense of IRM. In this paper, some ideas for generation of efficient coordinate vectors are presented. The algorithm was developed and tested independently and then implemented into the open source program FEAP. Method has been successfully applied to displacement based (even ill-conditioned) models of structural engineering practice. With this original approach, a new iterative solution strategy has been opened.