• Title/Summary/Keyword: Degree of approximation

Search Result 157, Processing Time 0.027 seconds

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.

CIRCLE APPROXIMATION USING PARAMETRIC POLYNOMIAL CURVES OF HIGH DEGREE IN EXPLICIT FORM

  • Ahn, Young Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.1259-1267
    • /
    • 2022
  • In this paper we present a full circle approximation method using parametric polynomial curves with algebraic coefficients which are curvature continuous at both endpoints. Our method yields the n-th degree parametric polynomial curves which have a total number of 2n contacts with the full circle at both endpoints and the midpoint. The parametric polynomial approximants have algebraic coefficients involving rational numbers and radicals for degree higher than four. We obtain the exact Hausdorff distances between the circle and the approximation curves.

A STUDY OF SIMULTANEOUS APPROXIMATION BY NEURAL NETWORKS

  • Hahm, N.;Hong, B.I.
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.317-324
    • /
    • 2008
  • This paper shows the degree of simultaneous neural network approximation for a target function in $C^r$[-1, 1] and its first derivative. We use the Jackson's theorem for differentiable functions to get a degree of approximation to a target function by algebraic polynomials and trigonometric polynomials. We also make use of the de La Vall$\grave{e}$e Poussin sum to get an approximation order by algebraic polynomials to the derivative of a target function. By showing that the divided difference with a generalized translation network can be arbitrarily closed to algebraic polynomials on [-1, 1], we obtain the degree of simultaneous approximation.

  • PDF

Polynomially Adjusted Normal Approximation to the Null Distribution of Ansari-Bradley Statistic

  • Ha, Hyung-Tae;Yang, Wan-Youn
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.6
    • /
    • pp.1161-1168
    • /
    • 2011
  • The approximation for the distribution functions of nonparametric test statistics is a significant step in statistical inference. A rank sum test for dispersions proposed by Ansari and Bradley (1960), which is widely used to distinguish the variation between two populations, has been considered as one of the most popular nonparametric statistics. In this paper, the statistical tables for the distribution of the nonparametric Ansari-Bradley statistic is produced by use of polynomially adjusted normal approximation as a semi parametric density approximation technique. Polynomial adjustment can significantly improve approximation precision from normal approximation. The normal-polynomial density approximation for Ansari-Bradley statistic under finite sample sizes is utilized to provide the statistical table for various combination of its sample sizes. In order to find the optimal degree of polynomial adjustment of the proposed technique, the sum of squared probability mass function(PMF) difference between the exact distribution and its approximant is measured. It was observed that the approximation utilizing only two more moments of Ansari-Bradley statistic (in addition to the first two moments for normal approximation provide) more accurate approximations for various combinations of parameters. For instance, four degree polynomially adjusted normal approximant is about 117 times more accurate than normal approximation with respect to the sum of the squared PMF difference.

On Approximation of Functions Belonging to Lip(α, r) Class and to Weighted W(Lr,ξ(t)) Class by Product Mean

  • Nigam, Hare Krishna;Sharm, Ajay
    • Kyungpook Mathematical Journal
    • /
    • v.50 no.4
    • /
    • pp.545-556
    • /
    • 2010
  • A good amount of work has been done on degree of approximation of functions belonging to Lip${\alpha}$, Lip($\xi$(t),r) and W($L_r,\xi(t)$) and classes using Ces$\`{a}$ro, N$\"{o}$rlund and generalised N$\"{o}$rlund single summability methods by a number of researchers ([1], [10], [8], [6], [7], [2], [3], [4], [9]). But till now, nothing seems to have been done so far to obtain the degree of approximation of functions using (N,$p_n$)(C, 1) product summability method. Therefore the purpose of present paper is to establish two quite new theorems on degree of approximation of function $f\;\in\;Lip({\alpha},r)$ class and $f\;\in\;W(L_r,\;\xi(t))$ class by (N, $p_n$)(C, 1) product summability means of its Fourier series.

GEOMETRIC CONIC SPLINE APPROXIMATION IN CAGD

  • Ahn, Young-Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.2
    • /
    • pp.331-347
    • /
    • 2002
  • We characterize the best geometric conic approximation to regular plane curve and verify its uniqueness. Our characterization for the best geometric conic approximation can be applied to degree reduction, offset curve approximation or convolution curve approximation which are very frequently occurred in CAGD (Computer Aided Geometric Design). We also present the numerical results for these applications.

FUNCTION APPROXIMATION OVER TRIANGULAR DOMAIN USING CONSTRAINED Legendre POLYNOMIALS

  • Ahn, Young-Joon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.9 no.2
    • /
    • pp.99-106
    • /
    • 2005
  • We present a relation between the orthogonality of the constrained Legendre polynomials over the triangular domain and the BB ($B{\acute{e}zier}\;-Bernstein$) coefficients of the polynomials using the equivalence of orthogonal complements. Using it we also show that the best constrained degree reduction of polynomials in BB form equals the best approximation of weighted Euclidean norm of coefficients of given polynomial in BB form from the coefficients of polynomials of lower degree in BB form.

  • PDF