• Title/Summary/Keyword: conjugate gradient algorithm

Search Result 100, Processing Time 0.028 seconds

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

  • Go, G.S.;Ahn, H.T.
    • Journal of computational fluids engineering
    • /
    • v.19 no.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
    • /
    • v.49 no.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)
    • /
    • v.9 no.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.

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

  • Kwon, Kee-Hong
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.3
    • /
    • pp.447-456
    • /
    • 2005
  • This paper describes iterative restoration method of restoring blurred images using the LOG compansion function and Conjugate Gradient method. Conventional restoration methods results satisfy the requirement performance for restoring blurred images. but iteration number and convergence velocity increase. This paper proposed an opmtimised iteration restoration method for the images degraded by blurring effect, using the LOG compansion function and Conjugate Gradient method. Here, the LOG compansion function used to improve local properties of the image being restored, made the visual character and convergence velocity of the restored image improved. Throught the simulation results, the author showed that proposed algorithm produced superior performance results by conventional methods.

  • PDF

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

  • Yoon, Jong Seon;Jeon, Byoung Jin;Jung, Hye Dong;Choi, Hyoung Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.40 no.9
    • /
    • pp.597-604
    • /
    • 2016
  • A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

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

  • 김영주;이경백;김영배
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • 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
    • /
    • v.3 no.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 (모바일 환경에 적합한 적응형 마쿼트 알고리즘 제시)

  • Lee, Jongsu;Hwang, Eunhan;Song, Sangseob
    • Smart Media Journal
    • /
    • v.3 no.2
    • /
    • pp.9-13
    • /
    • 2014
  • The Levenberg-Marquardt (LM) algorithm is the most widely used fitting algorithm. It outperforms simple gradient descent and other conjugate gradient methods in a wide variety of problems. Based on the work of paper[1], we propose a modified Levenberg-Marquardt algorithm for better performance of mobile system. The LM parameter at the $k_{th}$ iteration is chosen ${\mu}=A{\bullet}{\parallel}f(x){\parallel}{\bullet}I$ where f is the residual function, and J is the Jacobi of f. In this paper, we show this method is more efficient than traditional method under the situation that the system iteration is limited.

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.

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

  • Kim, Yun-Yeong;Kim, Jae-Eun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.8 s.179
    • /
    • 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.