• Title/Summary/Keyword: approximation

Search Result 4,955, Processing Time 0.04 seconds

APPROXIMATION OF QUADRIC SURFACES USING SPLINES

  • Ahn, Young-Joon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.3
    • /
    • pp.217-224
    • /
    • 2009
  • In this paper we present an approximation method of quadric surface using quartic spline. Our method is based on the approximation of quadratic rational B$\acute{e}$zier patch using quartic B$\acute{e}$zier patch. We show that our approximation method yields $G^1$ (tangent plane) continuous quartic spline surface. We illustrate our results by the approximation of helicoid-like surface.

  • PDF

The Properties of L-lower Approximation Operators

  • Kim, Yong Chan
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.1
    • /
    • pp.57-65
    • /
    • 2014
  • In this paper, we investigate the properties of L-lower approximation operators as a generalization of fuzzy rough set in complete residuated lattices. We study relations lower (upper, join meet, meet join) approximation operators and Alexandrov L-topologies. Moreover, we give their examples as approximation operators induced by various L-fuzzy relations.

A Note on Interval Approximation of a Fuzzy Number

  • Hong, Dug-Hun;Kim, Kyung-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.913-918
    • /
    • 2006
  • Chanas(2001) introduced the notion of interval approximation of a fuzzy number with the condition that the width of this interval is equal to the width of the expected interval. In this note, this condition is relaxed and the resulting formulae are derived for determining the approximation interval. This interval is compared with the expected interval and approximation interval of a fuzzy number as introduced by Chanas.

  • PDF

THE SIMULTANEOUS APPROXIMATION ORDER BY NEURAL NETWORKS WITH A SQUASHING FUNCTION

  • Hahm, Nahm-Woo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.4
    • /
    • pp.701-712
    • /
    • 2009
  • In this paper, we study the simultaneous approximation to functions in $C^m$[0, 1] by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive.

THE CAPABILITY OF PERIODIC NEURAL NETWORK APPROXIMATION

  • Hahm, Nahmwoo;Hong, Bum Il
    • Korean Journal of Mathematics
    • /
    • v.18 no.2
    • /
    • pp.167-174
    • /
    • 2010
  • In this paper, we investigate the possibility of $2{\pi}$-periodic continuous function approximation by periodic neural networks. Using the Riemann sum and the quadrature formula, we show the capability of a periodic neural network approximation.

MIXED FINITE ELEMENT APPROXIMATION OF A STEFAN PROBLEM

  • Shin, Jun-Yong
    • Journal of applied mathematics & informatics
    • /
    • v.11 no.1_2
    • /
    • pp.357-364
    • /
    • 2003
  • A fully discrete $H^1-mixed$ finite element approximation for the single-phase Stefan problem is introduced and the unique existence of the approximation is established. And some numerical experiments are given.

ON THE DEGREE OF APPROXIMATION FOR BIVARIATE LUPAS TYPE OPERATORS

  • Deo, Naokant
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1101-1116
    • /
    • 2010
  • The aim of this paper is to give some simultaneous approximation properties as well as differential properties, Voronovskaya type theorem, several asymptotic formulae for the partial derivative and the degree of approximation for two dimensional Lupas type operators.

Approximation of binomial Distribution via Dynamic Graphics

  • Lee, Kee-Won
    • Communications for Statistical Applications and Methods
    • /
    • v.6 no.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.

  • PDF

Exploration of errors in variance caused by using the first-order approximation in Mendelian randomization

  • Kim, Hakin;Kim, Kunhee;Han, Buhm
    • Genomics & Informatics
    • /
    • v.20 no.1
    • /
    • pp.9.1-9.6
    • /
    • 2022
  • Mendelian randomization (MR) uses genetic variation as a natural experiment to investigate the causal effects of modifiable risk factors (exposures) on outcomes. Two-sample Mendelian randomization (2SMR) is widely used to measure causal effects between exposures and outcomes via genome-wide association studies. 2SMR can increase statistical power by utilizing summary statistics from large consortia such as the UK Biobank. However, the first-order term approximation of standard error is commonly used when applying 2SMR. This approximation can underestimate the variance of causal effects in MR, which can lead to an increased false-positive rate. An alternative is to use the second-order approximation of the standard error, which can considerably correct for the deviation of the first-order approximation. In this study, we simulated MR to show the degree to which the first-order approximation underestimates the variance. We show that depending on the specific situation, the first-order approximation can underestimate the variance almost by half when compared to the true variance, whereas the second-order approximation is robust and accurate.