• Title/Summary/Keyword: Numerical Approximation

Search Result 1,033, Processing Time 0.028 seconds

IMPLICIT DIFFERENCE APPROXIMATION FOR THE TWO-DIMENSIONAL SPACE-TIME FRACTIONAL DIFFUSION EQUATION

  • Zhuang, Pinghui;Liu, Fawang
    • Journal of applied mathematics & informatics
    • /
    • v.25 no.1_2
    • /
    • pp.269-282
    • /
    • 2007
  • In this paper, we consider a two-dimensional fractional space-time diffusion equation (2DFSTDE) on a finite domain. We examine an implicit difference approximation to solve the 2DFSTDE. Stability and convergence of the method are discussed. Some numerical examples are presented to show the application of the present technique.

A FINITE DIFFERENCE APPROXIMATION OF A SINGULAR BOUNDARY VALUE PROBLEM

  • Lee, H.Y.;Ohm, M.R.;Shin, J.Y.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.473-484
    • /
    • 1998
  • We consider a finite difference approximation to a singular boundary value problem arising in the study of a nonlinear circular membrane under normal pressure. It is proved that the rate of convergence is $O(h^2)$. To obtain the solution of the finite difference equation, an iterative scheme converging monotonically to the solution of the finite difference equation is introduced. And the numerical experiment of this method is given.

  • PDF

CONSTRUCTIVE APPROXIMATION BY GAUSSIAN NEURAL NETWORKS

  • Hahm, Nahm-Woo;Hong, Bum-Il
    • Honam Mathematical Journal
    • /
    • v.34 no.3
    • /
    • pp.341-349
    • /
    • 2012
  • In this paper, we discuss a constructive approximation by Gaussian neural networks. We show that it is possible to construct Gaussian neural networks with integer weights that approximate arbitrarily well for functions in $C_c(\mathbb{R}^s)$. We demonstrate numerical experiments to support our theoretical results.

THE COMPUTATION OF MULTIVARIATE B-SPLINES WITH APPLICATION TO SURFACE APPROXIMATIONS

  • KIM, HOI SUB
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.1
    • /
    • pp.81-98
    • /
    • 1999
  • In spite of the well developed theory and the practical use of the univariate B-spline, the theory of multivariate B-spline is very new and waits its practical use. We compare in this article the multivariate B-spline approximation with the polynomial approximation for the surface fitting. The graphical and numerical comparisons show that the multivariate B-spline approximation gives much better fitting than the polynomial one, especially for the surfaces which vary very rapidly.

  • PDF

Efficient simulation using saddlepoint approximation for aggregate losses with large frequencies

  • Cho, Jae-Rin;Ha, Hyung-Tae
    • Communications for Statistical Applications and Methods
    • /
    • v.23 no.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.

THE CAPABILITY OF LOCALIZED NEURAL NETWORK APPROXIMATION

  • Hahm, Nahmwoo;Hong, Bum Il
    • Honam Mathematical Journal
    • /
    • v.35 no.4
    • /
    • pp.729-738
    • /
    • 2013
  • In this paper, we investigate a localized approximation of a continuously differentiable function by neural networks. To do this, we first approximate a continuously differentiable function by B-spline functions and then approximate B-spline functions by neural networks. Our proofs are constructive and we give numerical results to support our theory.

Tail Probability Approximations for the Ratio of the Independent Random Variables

  • Cho, Dae-Hyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.7 no.2
    • /
    • pp.189-201
    • /
    • 1996
  • In this paper, we study the saddlepoint approximations for the ratio of independent random variables. In Section 2, we derive the saddlepoint approximation to the density. And in Section 3, we derive two approximation formulae for the tail probability, one by following Daniels'(1987) method and the other by following Lugannani and Rice's (1980). In Section 4, we represent some numerical examples which show that the errors are small even for small sample size.

  • PDF

AN APPROXIMATION FOR THE QUEUE LENGTH DISTRIBUTION IN A MULTI-SERVER RETRIAL QUEUE

  • Kim, Jeongsim
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.95-102
    • /
    • 2016
  • Multi-server queueing systems with retrials are widely used to model problems in a call center. We present an explicit formula for an approximation of the queue length distribution in a multi-server retrial queue, by using the Lerch transcendent. Accuracy of our approximation is shown in the numerical examples.

ON SOME OUTSTANDING PROBLEMS IN NUCLEAR REACTOR ANALYSIS

  • Cho, Nam-Zin
    • Nuclear Engineering and Technology
    • /
    • v.44 no.2
    • /
    • pp.207-224
    • /
    • 2012
  • This article discusses selects of some outstanding problems in nuclear reactor analysis, with proposed approaches thereto and numerical test results, as follows: i) multi-group approximation in the transport equation, ii) homogenization based on isolated single-assembly calculation, and iii) critical spectrum in Monte Carlo depletion.

Tail Probability Approximations for the Ratio of two Independent Sequences of Random Variables

  • Cho, Dae-Hyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.10 no.2
    • /
    • pp.415-428
    • /
    • 1999
  • In this paper, we study the saddlepoint approximations for the ratio of two independent sequences of random variables. In Section 2, we review the saddlepoint approximation to the probability density function. In section 3, we derive an saddlepoint approximation formular for the tail probability by following Daniels'(1987) method. In Section 4, we represent a numerical example which shows that the errors are small even for small sample size.

  • PDF