• Title/Summary/Keyword: conjugate-gradient method

Search Result 218, Processing Time 0.041 seconds

Modified gradient methods hybridized with Tikhonov regularization for damage identification of spatial structure

  • Naseralavi, S.S.;Shojaee, S.;Ahmadi, M.
    • Smart Structures and Systems
    • /
    • v.18 no.5
    • /
    • pp.839-864
    • /
    • 2016
  • This paper presents an efficient method for updating the structural finite element model. Model updating is performed through minimizing the difference between the recorded acceleration of a real damaged structure and a hypothetical damaged one. This is performed by updating physical parameters (module of elasticity in this study) in each step using iterative process of modified nonlinear conjugate gradient (M-NCG) and modified Broyden-Fletcher-Goldfarb-Shanno algorithm (M-BFGS) separately. These algorithms are based on sensitivity analysis and provide a solution for nonlinear damage detection problem. Three illustrative test examples are considered to assess the performance of the proposed method. Finally, it is demonstrated that the proposed method is satisfactory for detecting the location and ratio of structural damage in presence of noise.

Parallel Algorithm of Conjugate Gradient Solver using OpenGL Compute Shader

  • Va, Hongly;Lee, Do-keyong;Hong, Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.1-9
    • /
    • 2021
  • OpenGL compute shader is a shader stage that operate differently from other shader stage and it can be used for the calculating purpose of any data in parallel. This paper proposes a GPU-based parallel algorithm for computing sparse linear systems through conjugate gradient using an iterative method, which perform calculation on OpenGL compute shader. Basically, this sparse linear solver is used to solve large linear systems such as symmetric positive definite matrix. Four well-known matrix formats (Dense, COO, ELL and CSR) have been used for matrix storage. The performance comparison from our experimental tests using eight sparse matrices shows that GPU-based linear solving system much faster than CPU-based linear solving system with the best average computing time 0.64ms in GPU-based and 15.37ms in CPU-based.

The Mixed Finite Element Analysis for Saturated Porous Media using FETI Method

  • Lee, Kyung-Jae;Tak, Moon-Ho;Park, Tae-Hyo
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.23 no.6
    • /
    • pp.693-702
    • /
    • 2010
  • In this paper, FETI(Finite Element Tearing and Interconnecting) method is introduced in order to improve numerical efficiency of Staggered method. The porous media theory, the Staggered method and the FETI method are briefly introduced in this paper. In addition, we account for the MPI(Message Passing Interface) library for parallel analysis, and the proposed combined Staggered method with FETI method. Finally Lagrange multipliers and CG(Conjugate Gradient) algorithm to solve decomposed domain are proposed, and then the proposed method is verified to be numerically efficient by MPI library.

A Study on Multi-Block Technique by Bi-CGSTAB Solver (Bi-CGSTAB 해법에 의한 복합격자망 해석방법에 관한 연구)

  • Bae, Jin-Hyo;Lee, Jae-Heon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.20 no.8
    • /
    • pp.2611-2625
    • /
    • 1996
  • A numerical method on multi-block technique by Bi-CGSTAB(Bi-Conjugate Gradient STABilized) solver has been proposed. The present multi-block technique can reduce the numerical manipulation greatly because the common regions at the interface of each block are not necessary. In order to test the computational performance of present multi-block technique, the flow characteristics in a T type duct system and a N type duct system have been investigated by three kinds of methods such as the single-block method, the previous multi-block technique and the multi-block technique with Bi-CGSTAB solver. The results indicated that the required CPU time by present multi block technique was shorter than that of other two numerical methods and the convergency history was shown very stable at the present multi-block technique.

A New Blind Beamforming Procedure Based on the Conjugate Gradient Method for CDMA Mobile Communications

  • Shin, Eung-Soon;Choi, Seung-Won;Shim, Dong-Hee;Kyeong, Mun-Geon;Chang, Kyung-Hi;Park, Youn-Ok;Han, Ki-Chul;Lee, Chung-Kun
    • ETRI Journal
    • /
    • v.20 no.2
    • /
    • pp.133-148
    • /
    • 1998
  • The objective of this paper is to present an adaptive algorithm for computing the weight vector which provides a beam pattern having its maximum gain along the direction of the mobile target signal source in the presence of interfering signals within a cell. The conjugate gradient method (CGM) is modified in such a way that the suboptimal weight vector is produced with the computational load of O(16N), which has been found to be small enough for the real-time processing of signals in most land mobile communications with the digital signal processor (DSP) off the shelf, where N denotes the number of antenna elements of the array. The adaptive procedure proposed in this paper is applied to code division multiple access (CDMA) mobile communication system to show its excellent performance in terms of signal to interference plus noise ratio (SINR), bit error rate (BER), and capacity, which are enhanced by about 7 dB, ${\frac{1}{100}}$ times, and 7 times, respectively, when the number of antenna elements is 6 and the processing gain is 20 dB.

  • PDF

Implementation and Experiments of Sparse Matrix Data Structure for Heat Conduction Equations

  • Kim, Jae-Gu;Lee, Ju-Hee;Park, Geun-Duk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.12
    • /
    • pp.67-74
    • /
    • 2015
  • The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

NONCONFORMING SPECTRAL ELEMENT METHOD FOR ELASTICITY INTERFACE PROBLEMS

  • Kumar, N. Kishore
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.5_6
    • /
    • pp.761-781
    • /
    • 2014
  • An exponentially accurate nonconforming spectral element method for elasticity systems with discontinuities in the coefficients and the flux across the interface is proposed in this paper. The method is least-squares spectral element method. The jump in the flux across the interface is incorporated (in appropriate Sobolev norm) in the functional to be minimized. The interface is resolved exactly using blending elements. The solution is obtained by the preconditioned conjugate gradient method. The numerical solution for different examples with discontinuous coefficients and non-homogeneous jump in the flux across the interface are presented to show the efficiency of the proposed method.

Inverse Design For a Airfoil Using Optimizing Method (최적화기법을 이용한 익형의 역설계)

  • Kim Jong-seub;Park Warn-gyu
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.126-130
    • /
    • 1997
  • A new and efficient method is presented for design optimization, which is based on a computational fluid dynamics (CFD). The method is applied to design an airfoil configuration. The Navier-Stokes equations are solved for the viscous analysis of the flow, which provides the object function. The CFD analysis is then coupled with the optimization procedure that used a conjugate gradient method. During the one-dimensional search of the optimization procedure, an approximate flow analysis based on a first-order Taylor series expansion is used to reduce the computational cost, (This study is supported by Korean Ministry of Education through Research Fund)

  • PDF

Fast GPU Implementation for the Solution of Tridiagonal Matrix Systems (삼중대각행렬 시스템 풀이의 빠른 GPU 구현)

  • Kim, Yong-Hee;Lee, Sung-Kee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.692-704
    • /
    • 2005
  • With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

Application of Iterative Procedure to the wave Field with Energy Dissipation Area (에너지 감쇠역을 포함하는 파랑장에 대한 반복기법의 적용)

  • 윤종태
    • Journal of Ocean Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.120-127
    • /
    • 1998
  • An Elliptic model for calculating the combined refraction/diffraction of monochromatic linear waves is developed, including a term which allows for the dissipation of wave energy. Conjugate gradient method is employed as a solution technique. Wave height variations are calculated for localized circular and rectangular dissipation areas. It is shown that the numerical results agree very well with analytical solution in the case of circular damping region. The localized dissipation area creates a shadow region of low wave energy and the recovery of wave height by diffraction occurs very slowly with distance behind the damping region.

  • PDF