• Title/Summary/Keyword: three-step iteration method

Search Result 16, Processing Time 0.019 seconds

Optimal Active-Control & Development of Optimization Algorithm for Reduction of Drag in Flow Problems(3) -Construction of the Formulation for True Newton Method and Application to Viscous Drag Reduction of Three-Dimensional Flow (드래그 감소를 위한 유체의 최적 엑티브 제어 및 최적화 알고리즘의 개발(3) - 트루 뉴턴법을 위한 정식화 개발 및 유체의 3차원 최적 엑티브 제어)

  • Bark, Jai-Hyeong
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.6
    • /
    • pp.751-759
    • /
    • 2007
  • We have developed several methods for the optimization problem having large-scale and highly nonlinear system. First, step by step method in optimization process was employed to improve the convergence. In addition, techniques of furnishing good initial guesses for analysis using sensitivity information acquired from optimization iteration, and of manipulating analysis/optimization convergency criterion motivated from simultaneous technique were used. We applied them to flow control problem and verified their efficiency and robustness. However, they are based on quasi-Newton method that approximate the Hessian matrix using exact first derivatives. However solution of the Navier-Stokes equations are very cost, so we want to improve the efficiency of the optimization algorithm as much as possible. Thus we develop a true Newton method that uses exact Hessian matrix. And we apply that to the three-dimensional problem of flow around a sphere. This problem is certainly intractable with existing methods for optimal flow control. However, we can attack such problems with the methods that we developed previously and true Newton method.

DEVELOPMENT OF AN UNSTRUCTURED HYBRID MESH FLOW SOLVER FOR 3-D STEADY/UNSTEADY INCOMPRESSIBLE FLOW SIMULATIONS (삼차원 정상/비정상 비압축성 유동해석을 위한 비정렬 혼합격자계 기반의 유동해석 코드 개발)

  • Jung, Mun-Seung;Kwon, Oh-Joon
    • Journal of computational fluids engineering
    • /
    • v.13 no.2
    • /
    • pp.27-41
    • /
    • 2008
  • An unstructured hybrid mesh flow solver has been developed for the simulation of three-dimensional steady and unsteady incompressible flow fields. The incompressible Navier-Stokes equations with an artificial compressibility method were discretized by using a node-based finite-volume method. For the unsteady time-accurate computation, a dual-time stepping method was adopted to satisfy a divergence-free flow field at each physical time step. An implicit time integration method with local time stepping was implemented to accelerate the convergence in the pseudo-time sub-iteration procedure. The one-equation Spalart-Allmaras turbulence model has been adopted to solve high-Reynolds number flow fields. The flow solver was parallelized to minimize the CPU time and to overcome the computational overhead. This method has been applied to calculate steady and unsteady flow fields around submarine configurations and a 3-D infinite cylinder. Validations were made by comparing the predicted results with those of experiments or other numerical results. It was demonstrated that the present method is efficient and robust for the prediction of steady and unsteady incompressible flow fields.

A Nonlinear Analysis of Two-Dimensional Beam Finite Elements (2차원(次元) 보 유한요소(有限要素) 비선형(非線型) 해석(解析))

  • Shin, Young Shik
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.4 no.3
    • /
    • pp.53-61
    • /
    • 1984
  • A nonlinear formulation of a beam finite element(NB6) on the total Lagrangian mode for the geometrically nonlinear analysis of two-dimensional elastic framed structures is presented. The NB6 beam element has been degenerated from the three-dimensional continuum by introducing the deep beam assumptions and consists of three reference nodes and three relative nodes. The element characteristics are derived by discretizing the beam equations of motion using the Galerkin weighted residual method and are reduced-integrated repeatedly for each loading step by the Newton-Raphson iteration techpique. Several numerical examples are given to demonstrate the accuracy and versatility of the proposed nonlinear NB6 beam element.

  • PDF

Conjugate Gradient Least-Squares Algorithm for Three-Dimensional Magnetotelluric Inversion (3차원 MT 역산에서 CG 법의 효율적 적용)

  • Kim, Hee-Joon;Han, Nu-Ree;Choi, Ji-Hyang;Nam, Myung-Jin;Song, Yoon-Ho;Suh, Jung-Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.2
    • /
    • pp.147-153
    • /
    • 2007
  • The conjugate gradient (CG) method is one of the most efficient algorithms for solving a linear system of equations. In addition to being used as a linear equation solver, it can be applied to a least-squares problem. When the CG method is applied to large-scale three-dimensional inversion of magnetotelluric data, two approaches have been pursued; one is the linear CG inversion in which each step of the Gauss-Newton iteration is incompletely solved using a truncated CG technique, and the other is referred to as the nonlinear CG inversion in which CG is directly applied to the minimization of objective functional for a nonlinear inverse problem. In each procedure we only need to compute the effect of the sensitivity matrix or its transpose multiplying an arbitrary vector, significantly reducing the computational requirements needed to do large-scale inversion.

Unsteady laminar boundary layer over a heated circular cylinder started impulsively from rest (갑자기 출발하는 가열된 원통 주위의 비정상 충류경계층 유동에 관한 수치적 연구)

  • 김재수;장근식
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.11 no.2
    • /
    • pp.262-270
    • /
    • 1987
  • A numerical method is presented which can solve the unsteady momentum and thermal boundary layers, coupled through the agency of buoyancy force, over a heated circular cylinder impulsively started from rest. By linearizing the nonlinear finite difference equations without sacrificing accuracy, numerical solutions are obtained at each time step without iteration. To get rid of the requirement of excessive number of grid points in the region of reversed flow, special form of transformed variables are used, by which the computational boundary layer thickness is maintained almost constant. These numerical properties enable the method to easily handle the region of reversed flow and how the singularity develops in the interior of the boundary layer. In order to investigated the thermal effects on the skin friction, heat flux, displacement thickness and on the separation, we have successfully solved three different cases of the buoyancy parameter .alpha.(Gr/Re$^{2}$).

Review on the Three-Dimensional Inversion of Magnetotelluric Date (MT 자료의 3차원 역산 개관)

  • Kim Hee Joon;Nam Myung Jin;Han Nuree;Choi Jihyang;Lee Tae Jong;Song Yoonho;Suh Jung Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.7 no.3
    • /
    • pp.207-212
    • /
    • 2004
  • This article reviews recent developments in three-dimensional (3-D) magntotelluric (MT) imaging. The inversion of MT data is fundamentally ill-posed, and therefore the resultant solution is non-unique. A regularizing scheme must be involved to reduce the non-uniqueness while retaining certain a priori information in the solution. The standard approach to nonlinear inversion in geophysis has been the Gauss-Newton method, which solves a sequence of linearized inverse problems. When running to convergence, the algorithm minimizes an objective function over the space of models and in the sense produces an optimal solution of the inverse problem. The general usefulness of iterative, linearized inversion algorithms, however is greatly limited in 3-D MT applications by the requirement of computing the Jacobian(partial derivative, sensitivity) matrix of the forward problem. The difficulty may be relaxed using conjugate gradients(CG) methods. A linear CG technique is used to solve each step of Gauss-Newton iterations incompletely, while the method of nonlinear CG is applied directly to the minimization of the objective function. These CG techniques replace computation of jacobian matrix and solution of a large linear system with computations equivalent to only three forward problems per inversion iteration. Consequently, the algorithms are efficient in computational speed and memory requirement, making 3-D inversion feasible.