• 제목/요약/키워드: approximation theory

검색결과 451건 처리시간 0.026초

최소 지름 신장 트리를 구하는 근사 알고리즘 (Approximation Algorithms for a Minimum-Diameter Spanning Tree)

  • 신찬수;박상민
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제30권5_6호
    • /
    • pp.319-323
    • /
    • 2003
  • 이차원 평면에 주어진 n개의 점 집합 P에 대한, 최소 신장 트리(minimum spanning tree, MST)는 P의 점들을 연결한 신장 트리 중에서 에지 길이의 총합이 최소가 되는 트리로 정의된다. P에 대한 신장 트리의 지름(diameter)은 트리의 두 점을 연결한 트리 경로 중에서 최장 경로의 길이로 정의되며, 최소 지름 신장 트리(minimum-diameter spanning tree, MDST)는 P에 대한 신장 트리 중에서 지름이 가장 작은 트리를 의미한다. 현재까지 알려진 가장 좋은 알고리즘[3]은 MDST를 O(n$^3$) 시간에 구한다. 본 논문에서는 MDST의 지름보다 최대 5/4배 이내의 지름을 보장하는 신장 트리를 구하는 $O(n^2)$ 시간 근사 알고리즘(approximation algorithm)을 제시한다. 이것은 MDST 문제에 관한 첫 번째 근사 알고리즘이다.

$H_{\infty}$ Composite Control for Singularly Perturbed Nonlinear Systems via Successive Galerkin Approximation

  • Kim, Young-Joong;Kim, Beom-Soo;Shin, Eun-Chul;Yoo, Ji-Yoon;Lim, Myo-Taeg
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.407-412
    • /
    • 2004
  • This paper presents a new algorithm for the closed-loop $H_{\infty}$ composite control of singularly perturbed nonlinear systems with a exogenous disturbance, using the successive Galerkin approximation(SGA). The singularly perturbed nonlinear system is decomposed into two subsystems of a slow-time scale and a fast-time scale via singular perturbation theory, and two $H_{\infty}$ control laws are obtained to each subsystem by using the SGA method. The composite control law that consists of two $H_{\infty}$ control laws of each subsystem is designed. One of the purposes of this paper is to design the closed-loop $H_{\infty}$ composite control law for the singularly perturbed nonlinear systems via the SGA method. The other is to reduce the computational complexity when the SGA method is applied to the high order systems.

  • PDF

Fast Mixed-Integer AC Optimal Power Flow Based on the Outer Approximation Method

  • Lee, Sungwoo;Kim, Hyoungtae;Kim, Wook
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권6호
    • /
    • pp.2187-2195
    • /
    • 2017
  • In order to solve the AC optimal power flow (OPF) problem considering the generators' on/off status, it is necessary to model the problem as mixed-integer nonlinear programming (MINLP). Because the computation time to find the optimal solution to the mixed-integer AC OPF problem increases significantly as the system becomes larger, most of the existing solutions simplify the problem either by deciding the on/off status of generators using a separate unit commitment algorithm or by ignoring the minimum output of the generators. Even though this kind of simplification may make the overall computation time tractable, the results can be significantly erroneous. This paper proposes a novel algorithm for the mixed-integer AC OPF problem, which can provide a near-optimal solution quickly and efficiently. The proposed method is based on a combination of the outer approximation method and the relaxed AC OPF theory. The method is applied to a real-scale power system that has 457 generators and 2132 buses, and the result is compared to the branch-and-bound (B&B) method and the genetic algorithm. The results of the proposed method are almost identical to those of the compared methods, but computation time is significantly shorter.

A meshfree adaptive procedure for shells in the sheet metal forming applications

  • Guo, Yong;Wu, C.T.;Park, C.K.
    • Interaction and multiscale mechanics
    • /
    • 제6권2호
    • /
    • pp.137-156
    • /
    • 2013
  • In this paper, a meshfree shell adaptive procedure is developed for the applications in the sheet metal forming simulation. The meshfree shell formulation is based on the first-order shear deformable shell theory and utilizes the degenerated continuum and updated Lagrangian approach for the nonlinear analysis. For the sheet metal forming simulation, an h-type adaptivity based on the meshfree background cells is considered and a geometric error indicator is adopted. The enriched nodes in adaptivity are added to the centroids of the adaptive cells and their shape functions are computed using a first-order generalized meshfree (GMF) convex approximation. The GMF convex approximation provides a smooth and non-negative shape function that vanishes at the boundary, thus the enriched nodes have no influence outside the adapted cells and only the shape functions within the adaptive cells need to be re-computed. Based on this concept, a multi-level refinement procedure is developed which does not require the constraint equations to enforce the compatibility. With this approach the adaptive solution maintains the order of meshfree approximation with least computational cost. Two numerical examples are presented to demonstrate the performance of the proposed method in the adaptive shell analysis.

Coding-based Storage Design for Continuous Data Collection in Wireless Sensor Networks

  • Zhan, Cheng;Xiao, Fuyuan
    • Journal of Communications and Networks
    • /
    • 제18권3호
    • /
    • pp.493-501
    • /
    • 2016
  • In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

Newton's Method to Determine Fourier Coefficients and Wave Properties for Deep Water Waves

  • JangRyong Shin
    • 한국해양공학회지
    • /
    • 제37권2호
    • /
    • pp.49-57
    • /
    • 2023
  • Since Chappelear developed a Fourier approximation method, considerable research efforts have been made. On the other hand, Fourier approximations are unsuitable for deep water waves. The purpose of this study is to provide a Fourier approximation suitable even for deep water waves and a numerical method to determine the Fourier coefficients and the wave properties. In addition, the convergence of the solution was tested in terms of its order. This paper presents a velocity potential satisfying the Laplace equation and the bottom boundary condition (BBC) with a truncated Fourier series. Two wave profiles were derived by applying the potential to the kinematic free surface boundary condition (KFSBC) and the dynamic free surface boundary condition (DFSBC). A set of nonlinear equations was represented to determine the Fourier coefficients, which were derived so that the two profiles are identical at specified phases. The set of equations was solved using Newton's method. This study proved that there is a limit to the series order, i.e., the maximum series order is N=12, and that there is a height limitation of this method which is slightly lower than the Michell theory. The reason why the other Fourier approximations are not suitable for deep water waves is discussed.

MEASURE THEORETICAL APPROACH FOR OPTIMAL SHAPE DESIGN OF A NOZZLE

  • FARAHI M. H.;BORZABADI A. H.;MEHNE H. H.;KAMYAD A. V.
    • Journal of applied mathematics & informatics
    • /
    • 제17권1_2_3호
    • /
    • pp.315-328
    • /
    • 2005
  • In this paper we present a new method for designing a nozzle. In fact the problem is to find the optimal domain for the solution of a linear or nonlinear boundary value PDE, where the boundary condition is defined over an unspecified domain. By an embedding process, the problem is first transformed to a new shape-measure problem, and then this new problem is replaced by another in which we seek to minimize a linear form over a subset of linear equalities. This minimization is global, and the theory allows us to develop a computational method to find the solution by a finite-dimensional linear programming problem.

삼차원 판이론의 유한요소해석 (Finite Element Analysis and Evaluation of a Three-dimensional Plate Theory)

  • 조한욱
    • 전산구조공학
    • /
    • 제8권1호
    • /
    • pp.147-160
    • /
    • 1995
  • 종속변수와 기본 탄성방정식의 가중잔차 근사식의 Fourier 급수 전개를 이용한 3차원 판이론을 제시하였다. 판의 가중잔차 평형방정식은 가중된 변위로 표시되며, 그 결과는 다시 위치에너지 Functional을 이용하여 유한요소해석을 수행하였다. 본 해석은 Strip판에 적용되어 2가지 예를 분석하였으며, 예제의 결과는 이론해와 잘 일치하였다.

  • PDF

SOLVING OF SECOND ORDER NONLINEAR PDE PROBLEMS BY USING ARTIFICIAL CONTROLS WITH CONTROLLED ERROR

  • Gachpazan, M.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • 제15권1_2호
    • /
    • pp.173-184
    • /
    • 2004
  • In this paper, we find the approximate solution of a second order nonlinear partial differential equation on a simple connected region in $R^2$. We transfer this problem to a new problem of second order nonlinear partial differential equation on a rectangle. Then, we transformed the later one to an equivalent optimization problem. Then we consider the optimization problem as a distributed parameter system with artificial controls. Finally, by using the theory of measure, we obtain the approximate solution of the original problem. In this paper also the global error in $L_1$ is controlled.

Ruled Surface의 곡률이론을 이용한 새로운 로봇궤적제어기법

  • 김재희;김상철;유범상
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1997년도 춘계학술대회 논문집
    • /
    • pp.683-691
    • /
    • 1997
  • This paper presents a new robot trajectory generation method based on the curvatre theory of ruled surfacees. robot trajectory is represented as a ruled surface generated by the TCP (Tool center point ) and any one unit vector among the tool frame (usually denoted O, A,N). The curvature theory of ruled surfaces provides the robot control algorithm with the motion property oarameters. The proposed method eliminates the necessity of approximation technic of either joint or cartesian interpolation. This technic may give new methodology of precision robot control. Especially this is very efficient when the robot traces an analytical or form surface if the surface is geometrically modelled.

  • PDF