• 제목/요약/키워드: conjugate gradient algorithm

검색결과 100건 처리시간 0.025초

직교격자상에서 효율적인 비압축성 자유표면유동 해법 (AN EFFICIENT ALGORITHM FOR INCOMPRESSIBLE FREE SURFACE FLOW ON CARTESIAN MESHES)

  • 고광수;안형택
    • 한국전산유체공학회지
    • /
    • 제19권4호
    • /
    • pp.20-28
    • /
    • 2014
  • An efficient solution algorithm for simulating free surface problem is presented. Navier-Stokes equations for variable density incompressible flow are employed as the governing equation on Cartesian meshes. In order to describe the free surface motion efficiently, VOF(Volume Of Fluid) method utilizing THINC(Tangent of Hyperbola for Interface Capturing) scheme is employed. The most time-consuming part of the current free surface flow simulations is the solution step of the linear system, derived by the pressure Poisson equation. To solve a pressure Poisson equation efficiently, the PCG(Preconditioned Conjugate Gradient) method is utilized. This study showed that the proper application of the preconditioner is the key for the efficient solution of the free surface flow when its pressure Poisson equation is solved by the CG method. To demonstrate the efficiency of the current approach, we compared the convergence histories of different algorithms for solving the pressure Poisson equation.

Cost optimization of reinforced high strength concrete T-sections in flexure

  • Tiliouine, B.;Fedghouche, F.
    • Structural Engineering and Mechanics
    • /
    • 제49권1호
    • /
    • pp.65-80
    • /
    • 2014
  • This paper reports on the development of a minimum cost design model and its application for obtaining economic designs for reinforced High Strength Concrete (HSC) T-sections in bending under ultimate limit state conditions. Cost objective functions, behavior constraint including material nonlinearities of steel and HSC, conditions on strain compatibility in steel and concrete and geometric design variable constraints are derived and implemented within the Conjugate Gradient optimization algorithm. Particular attention is paid to problem formulation, solution behavior and economic considerations. A typical example problem is considered to illustrate the applicability of the minimum cost design model and solution methodology. Results are confronted to design solutions derived from conventional design office methods to evaluate the performance of the cost model and its sensitivity to a wide range of unit cost ratios of construction materials and various classes of HSC described in Eurocode2. It is shown, among others that optimal solutions achieved using the present approach can lead to substantial savings in the amount of construction materials to be used. In addition, the proposed approach is practically simple, reliable and computationally effective compared to standard design procedures used in current engineering practice.

Image deblurring via adaptive proximal conjugate gradient method

  • Pan, Han;Jing, Zhongliang;Li, Minzhe;Dong, Peng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4604-4622
    • /
    • 2015
  • It is not easy to reconstruct the geometrical characteristics of the distorted images captured by the devices. One of the most popular optimization methods is fast iterative shrinkage/ thresholding algorithm. In this paper, to deal with its approximation error and the turbulence of the decrease process, an adaptive proximal conjugate gradient (APCG) framework is proposed. It contains three stages. At first stage, a series of adaptive penalty matrices are generated iterate-to-iterate. Second, to trade off the reconstruction accuracy and the computational complexity of the resulting sub-problem, a practical solution is presented, which is characterized by solving the variable ellipsoidal-norm based sub-problem through exploiting the structure of the problem. Third, a correction step is introduced to improve the estimated accuracy. The numerical experiments of the proposed algorithm, in comparison to the favorable state-of-the-art methods, demonstrate the advantages of the proposed method and its potential.

LOG함수의 특성을 이용한 영상잡음제거(1) (A Study on Image restoration Algorithm using LOG function character)

  • 권기홍
    • 한국컴퓨터산업학회논문지
    • /
    • 제6권3호
    • /
    • pp.447-456
    • /
    • 2005
  • 국부 반복 복원 처리는 영상 전체를 반복 복원하는 기존의 반복 복원과는 달리, 영상을 국부적으로 구분하여, 변화량이 큰 부분은 기존의 반복 복원으로 처리하고 변화량이 적은 부분은 LOG함수의 특성을 이용하여 신장 시킨 다음 처리하고, 다시 압축시키므로, 기존의 반복 복원 처리보다도 MSE(Mean Square Error)를 월등히 줄일 수 있을 뿐 아니라 변화량이 적은 부분도 처리가 잘되고, 또 기존의 반복처리 방법이 갖는, 적은 메모리 용량의 소요, 비선형 제약조건의 사용 가능, 약간의 변형으로 언제나 수렴성을 보장하는 등의 장점을 모두 가진다. 이 방법을 영상에 적용시킨 결과, MSE의 현저한 감소, 반복횟수 감소에 따른 반복시간 단축을 확인 할 수 있었다. 그러므로, 이 방법은 MSE를 줄이고 또한 처리 시간 단축을 목적으로 하는 영상의 복원에 적용될 수 있는 매우 우수한 방법임을 알 수 있다.

  • PDF

유한요소 비압축성 유동장 해석을 위한 이중공액구배법의 GPU 기반 연산에 대한 연구 (A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations)

  • 윤종선;전병진;정혜동;최형권
    • 대한기계학회논문집B
    • /
    • 제40권9호
    • /
    • pp.597-604
    • /
    • 2016
  • 본 연구에서는 GPU를 이용한 비압축성 유동장의 병렬연산을 위하여, P2P1 유한요소를 이용한 분리 알고리즘 내의 행렬 해법인 이중공액구배법(Bi-Conjugate Gradient)의 CUDA 기반 알고리즘을 개발하였다. 개발된 알고리즘을 이용해 비대칭 협착관 유동을 해석하고, 단일 CPU와의 계산시간을 비교하여 GPU 병렬 연산의 성능 향상을 측정하였다. 또한, 비대칭 협착관 유동 문제와 다른 행렬 패턴을 가지는 유체구조 상호작용 문제에 대하여 이중공액구배법 내의 희소 행렬과 벡터의 곱에 대한 GPU의 병렬성능을 확인하였다. 개발된 코드는 희소 행렬의 1개의 행과 벡터의 내적을 병렬 연산하는 커널(Kernel)로 구성되며, 최적화는 병렬 감소 연산(Parallel Reduction), 메모리 코얼레싱(Coalescing) 효과를 이용하여 구현하였다. 또한, 커널 생성 시 워프(Warp)의 크기에 따른 성능 차이를 확인하였다. 표준예제들에 대한 GPU 병렬연산속도는 CPU 대비 약 7배 이상 향상됨을 확인하였다.

신형회로망을 이용한 비젼기반 자율주행차량의 횡방향제어 (Lateral Control of Vision-Based Autonomous Vehicle using Neural Network)

  • 김영주;이경백;김영배
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2000년도 추계학술대회 논문집
    • /
    • pp.687-690
    • /
    • 2000
  • Lately, many studies have been progressed for the protection human's lives and property as holding in check accidents happened by human's carelessness or mistakes. One part of these is the development of an autonomouse vehicle. General control method of vision-based autonomous vehicle system is to determine the navigation direction by analyzing lane images from a camera, and to navigate using proper control algorithm. In this paper, characteristic points are abstracted from lane images using lane recognition algorithm with sobel operator. And then the vehicle is controlled using two proposed auto-steering algorithms. Two steering control algorithms are introduced in this paper. First method is to use the geometric relation of a camera. After transforming from an image coordinate to a vehicle coordinate, a steering angle is calculated using Ackermann angle. Second one is using a neural network algorithm. It doesn't need to use the geometric relation of a camera and is easy to apply a steering algorithm. In addition, It is a nearest algorithm for the driving style of human driver. Proposed controller is a multilayer neural network using Levenberg-Marquardt backpropagation learning algorithm which was estimated much better than other methods, i.e. Conjugate Gradient or Gradient Decent ones.

  • PDF

LATERAL CONTROL OF AUTONOMOUS VEHICLE USING SEVENBERG-MARQUARDT NEURAL NETWORK ALGORITHM

  • Kim, Y.-B.;Lee, K.-B.;Kim, Y.-J.;Ahn, O.-S.
    • International Journal of Automotive Technology
    • /
    • 제3권2호
    • /
    • pp.71-78
    • /
    • 2002
  • A new control method far vision-based autonomous vehicle is proposed to determine navigation direction by analyzing lane information from a camera and to navigate a vehicle. In this paper, characteristic featured data points are extracted from lane images using a lane recognition algorithm. Then the vehicle is controlled using new Levenberg-Marquardt neural network algorithm. To verify the usefulness of the algorithm, another algorithm, which utilizes the geometric relation of a camera and vehicle, is introduced. The second one involves transformation from an image coordinate to a vehicle coordinate, then steering is determined from Ackermann angle. The steering scheme using Ackermann angle is heavily depends on the correct geometric data of a vehicle and a camera. Meanwhile, the proposed neural network algorithm does not need geometric relations and it depends on the driving style of human driver. The proposed method is superior than other referenced neural network algorithms such as conjugate gradient method or gradient decent one in autonomous lateral control .

모바일 환경에 적합한 적응형 마쿼트 알고리즘 제시 (Adaptive Marquardt Algorithm based on Mobile environment)

  • 이종수;황은한;송상섭
    • 스마트미디어저널
    • /
    • 제3권2호
    • /
    • pp.9-13
    • /
    • 2014
  • 본 논문은 형광 X선 분석 시스템에서 관찰되는 스펙트럼에서 원하는 원소의 피크값을 검출하는데 쓰이는 마쿼트 알고리즘을 모바일 환경에서 더욱 효과적으로 사용하는 데에 있다. 이러한 마쿼트 알고리즘은 본래 잡음이 섞이기 전의 순수한 데이터가 무엇인지 알아가기 위한 유추해 가는 과정의 방법이다. 이러한 마쿼트 알고리즘에서 매우 중요한 역할을 하는 매개변수가 있는데 이 매개변수에 따라서 구하고자 하는 변수 값을 더욱 빠르게 구할 수도 있고 아닐 수도 있다. 기존의 방법에서 불필요한 계산량을 줄이기 위하여 매우 중요한 역할을 하는 매개변수인 ${\mu}$ 자리에 이 매개변수 대신 다른 매개변수를 도입한다. 또한 하드웨어적 측면을 고려시, 여러개의 정규분포의 모양으로 되어있는 함수를 여러개의 정규분포로 나누어서 생각하면 원하는 값을 구하기 더욱 간단해지지만 신뢰도 문제가 발생할 수 있다. 이러한 문제를 해결할 새로운 시스템을 제시한다.

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

  • Naseralavi, S.S.;Shojaee, S.;Ahmadi, M.
    • Smart Structures and Systems
    • /
    • 제18권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.

수정된 보간 웨이블렛응 이용한 적응 웨이블렛-콜로케이션 기법 (An Efficient Adaptive Wavelet-Collocation Method Using Lifted Interpolating Wavelets)

  • 김윤영;김재은
    • 대한기계학회논문집A
    • /
    • 제24권8호
    • /
    • pp.2100-2107
    • /
    • 2000
  • The wavelet theory is relatively a new development and now acquires popularity and much interest in many areas including mathematics and engineering. This work presents an adaptive wavelet method for a numerical solution of partial differential equations in a collocation sense. Due to the multi-resolution nature of wavelets, an adaptive strategy can be easily realized it is easy to add or delete the wavelet coefficients as resolution levels progress. Typical wavelet-collocation methods use interpolating wavelets having no vanishing moment, but we propose a new wavelet-collocation method on modified interpolating wavelets having 2 vanishing moments. The use of the modified interpolating wavelets obtained by the lifting scheme requires a smaller number of wavelet coefficients as well as a smaller condition number of system matrices. The latter property makes a preconditioned conjugate gradient solver more useful for efficient analysis.