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

검색결과 1,034건 처리시간 0.026초

무요소 콜로케이션법을 이용한 이종재료 계면해석 (Meshfree Collocation Method on the Interface between Bimaterial Media)

  • 김효진;윤영철;김동조;이상호
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2006년도 정기 학술대회 논문집
    • /
    • pp.365-372
    • /
    • 2006
  • A new meshfree formulation is developed for material discontinuity problems. A local interfacial jump function which is defined as hyperplane function is embedded in the meshless approximation and the approximation accurately models functions with jumps in the displacement and the derivative fields. Diffuse derivative technique copes with difficulty due to complexity of derivative computation of meshfree approximation. Collocation method with diffuse derivative accelerates computing speed for numerical solution. By solving inclusion and composite material problems, the robustness and effectiveness of the method are verified.

  • PDF

Hjorth모형과 Dhillon모형에 대한 재생함수 추정 (Approximation of the Renewal Function for Hjorth Model and Dhillon Model)

  • 남경현;장석주;김도훈
    • 품질경영학회지
    • /
    • 제34권1호
    • /
    • pp.34-39
    • /
    • 2006
  • This paper applies approximation of the renewal function for Hjorth model and Dhillon model which show the trend change in its aging properties. We obtain the renewal function for Hjorth model and Dhillon model by a numerical solution of an approximate integral. We observe the influence of each parameter in these models. The results of the computation are described and their corresponding graphs are provided.

TWO-SCALE PRODUCT APPROXIMATION FOR SEMILINEAR PARABOLIC PROBLEMS IN MIXED METHODS

  • Kim, Dongho;Park, Eun-Jae;Seo, Boyoon
    • 대한수학회지
    • /
    • 제51권2호
    • /
    • pp.267-288
    • /
    • 2014
  • We propose and analyze two-scale product approximation for semilinear heat equations in the mixed finite element method. In order to efficiently resolve nonlinear algebraic equations resulting from the mixed method for semilinear parabolic problems, we treat the nonlinear terms using some interpolation operator and exploit a two-scale grid algorithm. With this scheme, the nonlinear problem is reduced to a linear problem on a fine scale mesh without losing overall accuracy of the final system. We derive optimal order $L^{\infty}((0, T];L^2({\Omega}))$-error estimates for the relevant variables. Numerical results are presented to support the theory developed in this paper.

A QUADRATIC APPROXIMATION FOR PROTEIN SEQUENCE TO STRUCTURE MAPPING

  • Oh, Se-Young;Yun, Jae-Heon;Chung, Sei-Young
    • Journal of applied mathematics & informatics
    • /
    • 제12권1_2호
    • /
    • pp.155-164
    • /
    • 2003
  • A method is proposed to predict the distances between given residue pairs (between C$\sub$${\alpha}$/ atoms) of a protein using a sequence to structure mapping by indefinite quadratic approximation. The prediction technique requires a data fitting in three dimensional space with coordinates of the residues of known structured proteins and leads to a numerical ref resentation of 20 amino acids by minimizing a large least norm iteratively. These approximations are used in distance prediction for given residue pairs. Some computational experience on a test set of small proteins from Brookhaven Protein Data Bank are given.

민감도를 이용한 효율적인 반응표면모델생성 (Efficient Response Surface Modeling using Sensitivity)

  • 왕세명;김좌일
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 추계학술대회
    • /
    • pp.1882-1887
    • /
    • 2003
  • The response surface method (RSM) became one of famous meta modeling techniques, however its approximation errors give designers several restrictions. Classical RSM uses the least squares method (LSM) to find the best fitting approximation models from the all given data. This paper discusses how to construct RSM efficiently and accurately using moving least squares method (MLSM) with sensitivity information. In this method, several parameters should be determined during the construction of RSM. Parametric study and optimization for these parameters are performed. Several difficulties during approximation processes are described and numerical examples are demonstrated to verify the efficiency of this method.

  • PDF

Exponentially Fitted Error Correction Methods for Solving Initial Value Problems

  • Kim, Sang-Dong;Kim, Phil-Su
    • Kyungpook Mathematical Journal
    • /
    • 제52권2호
    • /
    • pp.167-177
    • /
    • 2012
  • In this article, we propose exponentially fitted error correction methods(EECM) which originate from the error correction methods recently developed by the authors (see [10, 11] for examples) for solving nonlinear stiff initial value problems. We reduce the computational cost of the error correction method by making a local approximation of exponential type. This exponential local approximation yields an EECM that is exponentially fitted, A-stable and L-stable, independent of the approximation scheme for the error correction. In particular, the classical explicit Runge-Kutta method for the error correction not only saves the computational cost that the error correction method requires but also gives the same convergence order as the error correction method does. Numerical evidence is provided to support the theoretical results.

A New Technique for Solving Optimal Control Problems of the Time-delayed Systems

  • Ghomanjani, Fateme
    • Kyungpook Mathematical Journal
    • /
    • 제58권2호
    • /
    • pp.333-346
    • /
    • 2018
  • An approximation scheme utilizing Bezier curves is considered for solving time-delayed optimal control problems with terminal inequality constraints. First, the problem is transformed, using a $P{\acute{a}}de$ approximation, to one without a time-delayed argument. Terminal inequality constraints, if they exist, are converted to equality constraints. A computational method based on Bezier curves in the time domain is then proposed for solving the obtained non-delay optimal control problem. Numerical examples are introduced to verify the efficiency and accuracy of the proposed technique. The findings demonstrate that the proposed method is accurate and easy to implement.

GCGM을 이용한 타원형 수치 파랑모형 (Elliptic Numerical Wave Model Using Generalized Conjugate Gradient Method)

  • 윤종태
    • 한국해안해양공학회지
    • /
    • 제10권2호
    • /
    • pp.93-99
    • /
    • 1998
  • 타원형 유한차분모형에서 개방 경계조건으로 포물선 근사식과 스폰지층 경계를 사용하여 모형의 개량을 도모하였다. 수치기법은 GCG(Generalized conjugate gradient)기법을 사용하였고 구형해저실험에서 포물형 근사식을 사용하여 부적절한 반사파를 상당 부분 제거할 수 있었다. 스폰지층 경계의 경우 2파장 이상의 스폰지층을 사용할 때 포물형 근사식과 유사한 결과를 얻을 수있었다. 직사각형 항만에 대한 실험을 통하여 임의 형상의 대상 해역에도 쉽게 모형을 적용할 수 있음을 확인하였다.

  • PDF

Estimating Reorder Points for ARMA Demand with Arbitrary Variable Lead Time

  • An, Bong-Geun;Hong, Kwan-Soo
    • 한국경영과학회지
    • /
    • 제17권2호
    • /
    • pp.91-106
    • /
    • 1992
  • It an inventory control system, the demand over time are often assumed to be independently identically distributed (i. i. d.). However, the demands may well be correlated over time in many situations. The estimation of reorder points is not simple for correlated demands with variable lead time. In this paper, a general class of autoregressive and moving average processes is considered for modeling the demands of an inventory item. The first four moments of the lead-time demand (L) are derived and used to approximate the distribution of L. The reorder points at given service level are then estimated by the three approximation methods : normal approximation, Charlier series and Pearson system. Numerical investigation shows that the Pearson system and the Charlier series performs extremely well for various situations whereas the normal approximation show consistent underestimation and sensitive to the distribution of lead time. The same conclusion can be reached when the parameters are estimated from the sample based on the simulation study.

  • PDF

Approximating Exact Test of Mutual Independence in Multiway Contingency Tables via Stochastic Approximation Monte Carlo

  • Cheon, Soo-Young
    • 응용통계연구
    • /
    • 제25권5호
    • /
    • pp.837-846
    • /
    • 2012
  • Monte Carlo methods have been used in exact inference for contingency tables for a long time; however, they suffer from ergodicity and the ability to achieve a desired proportion of valid tables. In this paper, we apply the stochastic approximation Monte Carlo(SAMC; Liang et al., 2007) algorithm, as an adaptive Markov chain Monte Carlo, to the exact test of mutual independence in a multiway contingency table. The performance of SAMC has been investigated on real datasets compared to with existing Markov chain Monte Carlo methods. The numerical results are in favor of the new method in terms of the quality of estimates.