• 제목/요약/키워드: Approximation Method

검색결과 2,543건 처리시간 0.027초

확장된 근사 알고리즘을 이용한 조합 방법 (Rule of Combination Using Expanded Approximation Algorithm)

  • 문원식
    • 디지털산업정보학회논문지
    • /
    • 제9권3호
    • /
    • pp.21-30
    • /
    • 2013
  • Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

G3 HEXIC Bézier CURVES APPROXIMATING CONIC SECTIONS

  • HYEONG MOON YOON;YOUNG JOON AHN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제28권1호
    • /
    • pp.22-32
    • /
    • 2024
  • In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G3 Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

1차 미분 근사를 이용한 MLS차분법의 동적해석 (Dynamic Analysis of MLS Difference Method using First Order Differential Approximation)

  • 김경환;윤영철;이상호
    • 한국전산구조공학회논문집
    • /
    • 제31권6호
    • /
    • pp.331-337
    • /
    • 2018
  • 본 논문은 MLS(moving least squares) 차분법의 1차 미분 근사함수를 바탕으로 시간에 따른 수치해석이 가능한 해석기법을 제시한다. 오직 1차 미분 근사함수로만 지배방정식을 이산화했으며, 근사함수를 조립하는 형태로 전체 시스템 방정식을 구성하여 차분법으로 이산화된 운동방정식이 유한요소법(finite element method)과 유사한 모습을 갖게 되었다. 운동방정식을 시간적분하기 위해서 중앙차분법(central difference method)을 사용하였다. 유한요소 알고리즘을 통해서 MLS 차분법과 유한요소법의 고유진동 해석을 수행하였으며, 두 해석결과를 비교하였다. 또한, 동적해석 결과를 기존의 2차 미분 근사함수를 활용한 해석결과와 함께 도시함으로써 제안된 수치기법의 정확성을 검증하였다. 1차 미분 근사함수를 조립하는 과정에서 해석결과의 떨림현상이 억제되었으며 상대적으로 균일한 응력분포를 구할 수 있었다.

이산 시간 접근 방법을 사용하는 2 개의 직렬계 비동일 부품 고장의 와이블 분포 모수의 베이시안 추정에 대한 타당성 조사 (A Feasibility Study on Bayesian Inference of Parameters of Weibull Distributions of Failures for Two Non-identical Components in Series System by using Discrete Time Approximation Method)

  • 정인승
    • 대한기계학회논문집A
    • /
    • 제33권10호
    • /
    • pp.1144-1150
    • /
    • 2009
  • This paper investigates the feasibility of the Bayesian discrete time approximation method to estimate the parameters of Weibull distributions of failures for two non-identical components connected in series system. A Bayesian model based on the discrete time approximation method is formulated to infer the Weibull parameters of two non-identical components with the failure data of the virtual tests. The study of this paper comes to a conclusion that the method is feasible only for some special cases under the given constraints on the concerned parameters.

Kirchhoff 근사 방법을 이용한 축소모델의 표적강도 예측 (Target Strength Prediction of Scaled Model by the Kirchhoff Approximation Method)

  • 김영현;주원호;김재수
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2004년도 춘계학술대회논문집
    • /
    • pp.442-445
    • /
    • 2004
  • The acoustic target strength (TS) of submarine is associated with its active detection, positioning and classification. That is, the survivability of submarine depends on its target strength. So it should be managed with all possible means. An anechoic coating to existing submarine or changing of curvature can be considered as major measures to reduce the TS of submarine. It is mainly based on the prediction of its TS. Under this circumstances, a study on the more accurate numerical methods becomes big topic for submarine design. In this paper, Kirchhoff approximation method was adopted as a numerical tool for the physical optics region. Secondly, the scaled models of submarine were built and tested in order to verify its performance. Through the comparison, it was found out that the Kirchhoff approximation method could be good design tool for the prediction of TS of submarine.

  • PDF

Proposal of Approximation Analysis Method for GI/G/1 Queueing System

  • Kong, Fangfang;Nakase, Ippei;Arizono, Ikuo;Takemoto, Yasuhiko
    • Industrial Engineering and Management Systems
    • /
    • 제7권2호
    • /
    • pp.143-149
    • /
    • 2008
  • There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.

A Meshfree procedure for the microscopic analysis of particle-reinforced rubber compounds

  • Wu, C.T.;Koishi, M.
    • Interaction and multiscale mechanics
    • /
    • 제2권2호
    • /
    • pp.129-151
    • /
    • 2009
  • This paper presents a meshfree procedure using a convex generalized meshfree (GMF) approximation for the large deformation analysis of particle-reinforced rubber compounds on microscopic level. The convex GMF approximation possesses the weak-Kronecker-delta property that guarantees the continuity of displacement across the material interface in the rubber compounds. The convex approximation also ensures the positive mass in the discrete system and is less sensitive to the meshfree nodal support size and integration order effects. In this study, the convex approximation is generated in the GMF method by choosing the positive and monotonic increasing basis function. In order to impose the periodic boundary condition in the unit cell method for the microscopic analysis, a singular kernel is introduced on the periodic boundary nodes in the construction of GMF approximation. The periodic boundary condition is solved by the transformation method in both explicit and implicit analyses. To simulate the interface de-bonding phenomena in the rubber compound, the cohesive interface element method is employed in corporation with meshfree method in this study. Several numerical examples are presented to demonstrate the effectiveness of the proposed numerical procedure in the large deformation analysis.

Efficient simulation using saddlepoint approximation for aggregate losses with large frequencies

  • Cho, Jae-Rin;Ha, Hyung-Tae
    • Communications for Statistical Applications and Methods
    • /
    • 제23권1호
    • /
    • pp.85-91
    • /
    • 2016
  • Aggregate claim amounts with a large claim frequency represent a major concern to automobile insurance companies. In this paper, we show that a new hybrid method to combine the analytical saddlepoint approximation and Monte Carlo simulation can be an efficient computational method. We provide numerical comparisons between the hybrid method and the usual Monte Carlo simulation.

파데 2차 근사방법을 사용한 제어기기의 동조 (A Controller Tuning Method by Pade Second Order Approximation)

  • Suh, Byung-Suhl
    • 대한전자공학회논문지
    • /
    • 제23권5호
    • /
    • pp.647-652
    • /
    • 1986
  • The controller tuning methods proposed by Yuwana-Seborg and Suh utilizes Pade first order approximation for the delay terms in the closed loop transfer function. In this paper, the use of a Pade second-order approximation method is investigated. The simulation results show that the new method is superior to pervious approaches such as Ziegler-Nichols and Cohen-Coon methods.

  • PDF

Routh Approximants with Arbitrary Order

  • Younseok Choo;Kim, Dongmin
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제1권1호
    • /
    • pp.50-53
    • /
    • 1999
  • It has been pointed out in the literature that the Routh approximation method for order reduction has limitations in treating transfer functions with the denominator-numerator order difference not equal to one. The purpose of this paper is to present a new algorithm based on the Routh approximation method that can be applied to general rational transfer functions, yield ing reduced models with arbitrary order.

  • PDF