• Communications for Statistical Applications and Methods
• /
• 제6권3호
• /
• pp.821-830
• /
• 1999

In This paper we calculate the probabilities of binomial and Poisson distributions when n or${\mu}$ is large. Based on this calculation we consider the normal approximation to the binomial and binomial approximation to Poisson. We implement this approximation via CGI and dynamic graphs. These implementation are made available through the internet.

• 대한산업공학회지
• /
• 제1권1호
• /
• pp.87-92
• /
• 1975

Three approximation methods for generating outcomes on Poisson random variables are discussed. A comparison is made to determine which method requires the least computer execution time and to determine which is the most robust approximation. Results of the comparison study suggest the method to choose for the generating procedure depends on the mean value of Poisson random variable which is being generated.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.25-42
• /
• 2007

A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.153-168
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A matrix geometric method is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.27-44
• /
• 2001

A fast Poisson solver on irregular domains, based on bound-ary methods, is presented. The harmonic polynomial approximation of the solution of the associated homogeneous problem provides a good practical boundary method which allows a trivial parallel processing for solution evaluation or straightfoward computations of the interface values for domain decomposition/embedding. AMS Mathematics Subject Classification : 65N35, 65N55, 65Y05.

• Communications for Statistical Applications and Methods
• /
• 제16권6호
• /
• pp.971-978
• /
• 2009

Poisson generalized linear mixed models(GLMMs) have been widely used for the analysis of clustered or correlated count data. For the inference marginal likelihood, which is obtained by integrating out random effects is often used. It gives maximum likelihood(ML) estimator, but the integration is usually intractable. In this paper, we propose how to obtain the ML estimator via Laplace approximation based on hierarchical-likelihood (h-likelihood) approach under the Poisson GLMMs. In particular, the h-likelihood avoids the integration itself and gives a statistically efficient procedure for various random-effect models including GLMMs. The proposed method is illustrated using two practical examples and simulation studies.

• 응용통계연구
• /
• 제22권5호
• /
• pp.937-942
• /
• 2009

본 논문에서는 보험 상품의 잉여금(surplus)을 확률적으로 모형화한 후, 잉여금의 파산 확률과 이의 근사 공식들을 소개한다. 잉여금은 일정한 율(rate)로 들어오는 프리미엄(premium)에 의해 증가한다. 보험금 청구(claim)는 포아송 과정(Poisson process)을 따라 발생하고 보험금 청구가 있을 때마다 잉여금은 임의의 양(random amount) 만큼 줄어든다. 잉여금이 0이하로 떨어지면 파산(ruin)이 발생한다고 한다. 이와 같은 리스크(risk) 모형에서 파산 확률의 이론적 공식은 잘 알려져 있으나, 공식에 n차 공률(convolution)과 무한 합(infinite sum)이 포함되어 있어 실질적인 계산은 불가능하다. 본 논문에서는 잘 알려진 De Vylder의 근사 공식과 지수적인 근사 공식(exponential approximation)을 소개하고, 이들을 일반화한 새로운 근사 공식을 제안한다. 기존 근사 공식과의 수치적 비교를 통해 새로 제안된 근사 공식의 우월성을 보인다.

• Journal of the Korean Data and Information Science Society
• /
• 제27권5호
• /
• pp.1389-1397
• /
• 2016

Semi-parametric frailty model with nonparametric baseline hazards has been widely used for the analyses of clustered survival-time data. The frailty models can be fitted via an auxiliary Poisson hierarchical generalized linear model (HGLM). For the inferences of the frailty model marginal likelihood, which gives MLE, is often used. The marginal likelihood is usually obtained by integrating out random effects, but it often requires an intractable integration. In this paper, we propose to obtain the MLE via Laplace approximation using a Poisson HGLM approach for semi-parametric frailty model. The proposed HGLM approach uses hierarchical-likelihood (h-likelihood), which avoids integration itself. The proposed method is illustrated using a numerical study.

• 한국경영과학회지
• /
• 제31권3호
• /
• pp.63-79
• /
• 2006

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied immediately are either backordered or lost according to the number of demands that exist at their arrival Instants. For this system we develop an approximation method to calculate performance measures such as steady state probabilities of the number of parts at each station, proportion of lost demands and the mean number of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation show that the approximation method provides fairly good results.

• 대한수학회지
• /
• 제40권6호
• /
• pp.1075-1083
• /
• 2003

The purpose of this paper is to investigate the piecewise wise polynomial approximation for the curved boundary. We analyze the error of an approximated solution due to this approximation and then compare the approximation errors for the cases of polygonal and piecewise polynomial approximations for the curved boundary. Based on the results of analysis, p-version numerical methods for solving Dirichlet's problems are applied to any smooth curved domain.