• 제목/요약/키워드: Discretization Algorithm

검색결과 124건 처리시간 0.021초

영역별 절점재구성을 통한 격자재구성 및 소성가공해석 (Mesh Reconstruction Using Redistibution of Nodes in Sub-domains and Its Application to the Analyses of Metal Forming Problems)

  • 홍진태;양동열
    • 한국CDE학회논문집
    • /
    • 제12권4호
    • /
    • pp.255-262
    • /
    • 2007
  • In the finite element analysis of forming process, objects are described with a finite number of elements and nodes and the approximated solutions can be obtained by the variational principle. One of the shortcomings of a finite element analysis is that the structure of mesh has become inefficient and unusable because discretization error increases as deformation proceeds due to severe distortion of elements. If the state of current mesh satisfies a certain remeshing criterion, analysis is stopped instantly and resumed with a reconstructed mesh. In the study, a new remeshing algorithm using tetrahedral elements has been developed, which is adapted to the desired mesh density. In order to reduce the discretization error, desired mesh sizes in each lesion of the workpiece are calculated using the Zinkiewicz and Zhu's a-posteriori error estimation scheme. The pre-constructed mesh is constructed based on the modified point insertion technique which is adapted to the density function. The object domain is divided into uniformly-sized sub-domains and the numbers of nodes in each sub-domain are redistributed, respectively. After finishing the redistribution process of nodes, a tetrahedral mesh is reconstructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.

COMPARATIVE STUDY OF NUMERICAL ALGORITHMS FOR THE ARITHMETIC ASIAN OPTION

  • WANG, JIAN;BAN, JUNGYUP;LEE, SEONGJIN;YOO, CHANGWOO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제22권1호
    • /
    • pp.75-89
    • /
    • 2018
  • This paper presents the numerical valuation of the arithmetic Asian option by using the operator-splitting method (OSM). Since there is no closed-form solution for the arithmetic Asian option, finding a good numerical algorithm to value the arithmetic Asian option is important. In this paper, we focus on a two-dimensional PDE. The OSM is famous for dealing with plural-dimensional PDE using finite difference discretization. We provide a detailed numerical algorithm and compare results with MCS method to show the performance of the method.

Semi-Lagrangian법을 이용한 구 좌표계에서의 이류 방정식 해석 (Numerical Simulation for the Advection Equation on the Sphere by Sphere-Lagrangian Method)

  • 윤성영
    • 한국전산유체공학회지
    • /
    • 제9권3호
    • /
    • pp.8-17
    • /
    • 2004
  • A Semi-Lagrangian method based on CIP(Cubic Interpolated Pseudoparticle)method is proposed and it is applied to solve the two dimensional advection equation. Especially the attentions are given to settle the pole problem and to enhance the accuracy in solving the advection equation on the spherical coordinate system. Tn this algorithm, the CU method is employed as the Semi-Lagrangian method and extended to the spherical coordinate system. To enhance the accuracy of the solution, the spatial discretization is made by CIP method. The mathematical formulation and numerical results are also described. To verify the efficiency, accuracy and capability of proposed algorithm, two dimensional rotating cosine bell problem and the frontogenesis problem are simulated by the present scheme. As results, it is confirmed that the present scheme gives an accurate solution and settles the pole problem in the advection equation on the sphere.

전력거래에서의 내쉬균형점 해석을 위한 Bimatrix 게임 기법 연구 (Bimatrix Game Approach to Power System Market Analysis)

  • 이광호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 하계학술대회 논문집 A
    • /
    • pp.380-382
    • /
    • 2002
  • An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithm. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

  • PDF

전 속도영역 유동을 위한 비정렬격자 압력기반해법 (Unstructured Pressure Based Method for All Speed Flows)

  • 최형일;이도형;맹주성
    • 대한기계학회논문집B
    • /
    • 제26권11호
    • /
    • pp.1521-1530
    • /
    • 2002
  • This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.

Discrete-Time Sliding Mode Control for Robot Manipulators

  • 박재삼
    • 한국산업정보학회논문지
    • /
    • 제16권4호
    • /
    • pp.45-52
    • /
    • 2011
  • In the real-field of control cases for robot manipulators, there always exists a modeling error, which results the model has the uncertainties in its parameters and/or structure. In many modem applications, digital computers are extensively used to implement control algorithms to control such systems. The discretization of the nonlinear dynamic equations of such systems results in a complicated discrete dynamic equations. Therefore, it will be difficult to design a discrete-time controller to give good tracking performances in the presence of certain uncertainties. In this paper, a discrete-time sliding mode control algorithm for nonlinear and time varying robot manipulators with uncertainties is presented. Sufficient conditions for guaranteeing the convergence of the discrete-time SMC system are derived. As example simulations, the proposed SMC algorithm is applied to a two-link robotic manipulator with unknown dynamics. The results of the simulation indicate that the developed control scheme is effective in manipulators and electro-mechanical system control.

전기기기 최적형상 설계를 위한 민감도 해석에 관한 연구 (Sensitivity Analysis for Optimum Shape Design of Electric Apparatus)

  • Hahn, Song-Yop;Jung, Hyun-Kyo
    • 대한전기학회논문지
    • /
    • 제40권9호
    • /
    • pp.859-865
    • /
    • 1991
  • This paper presents a new shaoe optimal design method using Desing Sensitivity Analysis. Design Sensitivity, defined as the variation of the object function with respect to the design variables, is based on the total differentiation of the matrix equation obtained from discretization of governing equations with respect to design variables. Analysis of the various characteristics adn calculation of Design Sensitivity of optimization model are achieved by using finite or boundary element methods. The proposee algorithm is applied to the optimal shape design of high voltage electrode under specified conditions. It is shown, from the numerical results, that the algorithm is very useful for the optimal shape design of electric apparatus.

Kinodynamic Motion Planning with Artificial Wavefront Propagation

  • Ogay, Dmitriy;Kim, Eun-Gyung
    • Journal of information and communication convergence engineering
    • /
    • 제11권4호
    • /
    • pp.274-281
    • /
    • 2013
  • In this study, we consider the challenges in motion planning for automated driving systems. Most of the existing online motion-planning algorithms, which take dynamics into account, find it difficult to operate in an environment with narrow passages. Some of the existing algorithms overcome this by offline preprocessing if environment is known. In this work an online algorithm for motion planning with dynamics in an unknown cluttered environment with narrow passages is presented. It utilizes an idea of hybrid planning with sampling- and discretization-based motion planners, which run simultaneously in a full configuration space and a derived reduced space. The proposed algorithm has been implemented and tested with a real autonomous vehicle. It provides significant improvements in computational time performance over basic planning algorithms and allows the generation of smoother paths than those generated by the recently developed hybrid motion planners.

고속 WALSH 변환에 의한 분포정수계의 최적제어 (Optimal Control of Distributed Parameter Systems Via Fast WALSH Transform)

  • 김태훈;김진태;이승;안두수
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제50권10호
    • /
    • pp.464-472
    • /
    • 2001
  • This study uses distributed parameter systems as the spatial discretization technique, modelling in lumped parameter systems, and applies fast WALSH transform and the Picard's iteration method to high order partial differential equations and matrix partial differential equations. This thesis presents a new algorithm which usefully exercises the optimal control in the distributed parameter systems. In exercising optimal control of distributed parameter systems, excellent consequences are found without using the existing decentralized control or hierarchical control method. This study will help apply to linear time-varying systems and non-linear systems. Further research on algorithm will be required to solve the problems of convergence in case of numerous applicable intervals.

  • PDF

The Application of Multigrid Algorithm to Low-Speed Precondition

  • Yang, Zhong;Xu, Jianzhong
    • 한국추진공학회:학술대회논문집
    • /
    • 한국추진공학회 2008년 영문 학술대회
    • /
    • pp.666-670
    • /
    • 2008
  • The low-speed preconditioning technique is applied to solve the compressible Reynolds averaged Navier-Stokes equations for low-speed flows. The space discretization is based on Roe's flux-difference splitting with third-order-accurate MUSCL extrapolation. Time integration is performed employing a diagonal approximate factorization algorithm. The dual-time stepping has been incorporated to solve the unsteady flows. Full multigrid method is implemented to accelerate the convergence rate. To verify the algorithms several cases have been tested. Demonstrated the improvement on convergence and quality of the solution.

  • PDF