• Title/Summary/Keyword: optimal order

Search Result 6,424, Processing Time 0.032 seconds

ERROR ESTIMATES OF MIXED FINITE ELEMENT APPROXIMATIONS FOR A CLASS OF FOURTH ORDER ELLIPTIC CONTROL PROBLEMS

  • Hou, Tianliang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.4
    • /
    • pp.1127-1144
    • /
    • 2013
  • In this paper, we consider the error estimates of the numerical solutions of a class of fourth order linear-quadratic elliptic optimal control problems by using mixed finite element methods. The state and co-state are approximated by the order $k$ Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise polynomials of order $k(k{\geq}1)$. $L^2$ and $L^{\infty}$-error estimates are derived for both the control and the state approximations. These results are seemed to be new in the literature of the mixed finite element methods for fourth order elliptic control problems.

Optimal Design of Graphite Sheet based Cryogenic Cooler Thermal Control System using Veritrek Software (Veritrek 소프트웨어를 활용한 그라파이트시트 기반 극저온 냉각기 열 제어 시스템 최적설계)

  • Bong-Geon Chae;Hye-In Kim;Hyun-Ung Oh
    • Journal of Aerospace System Engineering
    • /
    • v.18 no.2
    • /
    • pp.71-78
    • /
    • 2024
  • During the initial thermal design process, determining the thermal effect of various design variables in a complex orbital thermal environment is time-consuming. To save time in the initial design phase, it is necessary to quickly derive optimal design parameters and predict the temperature. To address these challenges, Veritrek, a software specialized in optimal design using a reduced-order model (ROM), was released in 2018. In this paper, we utilized the Veritrek software to build a reduced-order model, conduct sensitivity analysis, and perform optimal design analysis for a graphite sheet-based cryogenic cooler thermal control system. The goal was to determine the optimal design values for the number of graphite sheet layers, radiator area, and thickness that would meet the allowable temperature of the cryogenic cooler.

Analysis and Optimal design of Axial Magnetic Bearings (축방향 자기베어링의 해석 및 최적설계)

  • 박영진
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1997.10a
    • /
    • pp.278-283
    • /
    • 1997
  • This paper proposes a systematic design method for axial(or thrust) magnetic bearings using optimal design methodology. The objective of the optimal design is to minimize bearing volume. The constraints include the bearing load capacity, linearized bearing stiffness and damping, the magnetic flux density, and geometric relations. In order to obtain design values which can be applied to fabrication of bearings, branch and bound method was introduced in the postprocessing procedure of optimal design results. Verification of the proposed design methodology was perfomed by an example.

  • PDF

FINITE ELEMENT APPROXIMATION AND COMPUTATIONS OF BOUNDARY OPTIMAL CONTROL PROBLEMS FOR THE NAVIER-STOKES FLOWS THROUGH A CHANNEL WITH STEPS

  • Lee, Hyung-Chun;Lee, Yong-Hun
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.1
    • /
    • pp.173-192
    • /
    • 1999
  • We study a boundary optimal control problem of the fluid flow governed by the Navier-Stokes equations. the control problem is formulated with the flow through a channel with steps. The first-order optimality condition of the optimal control is derived. Finite element approximations of the solutions of the optimality system are defined and optimal error estimates are derived. finally, we present some numerical results.

  • PDF

Optimal supervisory control for multiple-modelled discrete event systems

  • Lee, Moon-Sang;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.73.5-73
    • /
    • 2001
  • In this paper, we present a procedure to design the robust optimal supervisor which has the minimal cost in the sense of average for a given multiple-modelled discrete event system DES. In order to design the robust optimal supervisor, we extend the optimal supervisor design algorithm for a deterministic DES to the case of multiple-modelled DESs. In addition, using the proposed algorithm with modified costs of events and penalities of states, we can show whether a robust supervisor for a given multiple-modelled DES exists and design the minimally restricted robust supervisor.

  • PDF

Steady State Optimal Control of Discrete Weakly Coupled Bilinear Systems

  • Kang, Hyun-Goo;Kim, Beom-Soo;Lim, Myo-Taeg
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.38.6-38
    • /
    • 2001
  • This paper presents a steady state optimal control algorithm for the weakly coupled discrete time bilinearsystems. The optimal solution for the overall system is obtained by solving a sequence of reduced order algebraic Riccati equations with an arbitrary accuracy. The obtained solutions converge to the optimal solutions by using the iteration method. We verify the proposed method by applying it to a real world numerical example.

  • PDF

Optimal Blank Design for Sheet Metal Stamping (박판성형공정의 블랭크 최적설계)

  • 김용환
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2000.04a
    • /
    • pp.141-145
    • /
    • 2000
  • A systematic method to find the optimal blank shape for sheet forming is proposed by coupling the numerical simulation technique. A weighted parameter was introduced in order to simplify the multi-variable optimization problem to a single-variable problem. The proposed method has been applied to the blank design of drawing processes to obtain the near-net shape within the required error bound after forming, Excellent results have been obtained between the numerical results and the target contour shapes. Through the investigation the proposed systematic method for optimal blank design is found to be effective in the practical forming processes

  • PDF

Optimization of V-groove Arc Welding Process Using Genetic Algorithm (유전 알고리즘을 이용한 V그루브 아크 용접 공정변수 최적화)

  • 안홍락;이세헌;안승호;강문진
    • Proceedings of the KWS Conference
    • /
    • 2003.05a
    • /
    • pp.172-175
    • /
    • 2003
  • A genetic algorithm was applied to an arc welding process to determine near optimal settings of welding process parameters which produce good weld quality. It has an advantage of being able to find optimal conditions with a fewer number of experiments than conventional full factorial design. According to the conventional full factorial design, in order to find the optimal welding conditions, 16,384 experiments must be performed. The genetic algorithm however, found the near optimal welding conditions from less than 60 experiments.

  • PDF

Quantization Data Transmission for Optimal Path Search of Multi Nodes in cloud Environment (클라우드 환경에서 멀티 노드들의 최적 경로 탐색을 위한 양자화 데이터 전송)

  • Oh, HyungChang;Kim, JaeKwon;Kim, TaeYoung;Lee, JongSik
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.2
    • /
    • pp.53-62
    • /
    • 2013
  • Cloud environment is one in the field of distributed computing and it consists of physical nodes and virtual nodes. In distributed cloud environment, an optimal path search is that each node to perform a search for an optimal path. Synchronization of each node is required for the optimal path search via fast data transmission because of real-time environment. Therefore, a quantization technique is required in order to guarantee QoS(Quality of Service) and search an optimal path. The quantization technique speeds search data transmission of each node. So a main server can transfer data of real-time environment to each node quickly and the nodes can perform to search optimal paths smoothly. In this paper, we propose the quantization technique to solve the search problem. The quantization technique can reduce the total data transmission. In order to experiment the optimal path search system which applied the quantized data transmission, we construct a simulation of cloud environment. Quantization applied cloud environment reduces the amount of data that transferred, and then QoS of an application for the optimal path search problem is guaranteed.