• Title/Summary/Keyword: polynomial functions

Search Result 445, Processing Time 0.022 seconds

Polynomial Boundary Treatment for Wavelet Regression

  • Oh Hee-Seok;Naveau Philppe;Lee GeungHee
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2000.11a
    • /
    • pp.27-32
    • /
    • 2000
  • To overcome boundary problems with wavelet regression, we propose a simple method that reduces bias at the boundaries. It is based on a combination of wavelet functions and low-order polynomials. The utility of the method is illustrated with simulation studies and a real example. Asymptotic results show that the estimators are competitive with other nonparametric procedures.

  • PDF

POLYNOMIAL GROWTH HARMONIC MAPS ON COMPLETE RIEMANNIAN MANIFOLDS

  • Lee, Yong-Hah
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.3
    • /
    • pp.521-540
    • /
    • 2004
  • In this paper, we give a sharp estimate on the cardinality of the set generating the convex hull containing the image of harmonic maps with polynomial growth rate on a certain class of manifolds into a Cartan-Hadamard manifold with sectional curvature bounded by two negative constants. We also describe the asymptotic behavior of harmonic maps on a complete Riemannian manifold into a regular ball in terms of massive subsets, in the case when the space of bounded harmonic functions on the manifold is finite dimensional.

Sensitivity analysis of variable curvature friction pendulum isolator under near-fault ground motions

  • Shahbazi, Parisa;Taghikhany, Touraj
    • Smart Structures and Systems
    • /
    • v.20 no.1
    • /
    • pp.23-33
    • /
    • 2017
  • Variable Curvature Friction Pendulum (VCFP) bearing is one of the alternatives to control excessive induced responses of isolated structures subjected to near-fault ground motions. The curvature of sliding surface in this isolator is varying with displacement and its function is non-spherical. Selecting the most appropriate function for the sliding surface depends on the design objectives and ground motion characteristics. To date, few polynomial functions have been experimentally tested for VCFP however it needs comprehensive parametric study to find out which one provides the most effective behavior. Herein, seismic performance of the isolated structure mounted on VCFP is investigated with two different polynomial functions of the sliding surface (Order 4 and 6). By variation of the constants in these functions through changing design parameters, 120 cases of isolators are evaluated and the most proper function is explored to minimize floor acceleration and/or isolator displacement under different hazard levels. Beside representing the desire sliding surface with adaptive behavior, it was shown that the polynomial function with order 6 has least possible floor acceleration under seven near-field ground motions in different levels.

Mathematical Structures of Polynomials in Jeong Yag-yong's Gugo Wonlyu (정약용(丁若鏞)의 산서(算書) 구고원류(勾股源流)의 다항식(多項式)의 수학적(數學的) 구조(構造))

  • Hong, Sung Sa;Hong, Young Hee;Lee, Seung On
    • Journal for History of Mathematics
    • /
    • v.29 no.5
    • /
    • pp.257-266
    • /
    • 2016
  • This paper is a sequel to our paper [3]. Although polynomials in the tianyuanshu induce perfectly the algebraic structure of polynomials, the tianyuan(天元) is always chosen by a specific unknown in a given problem, it can't carry out the role of the indeterminate in ordinary polynomials. Further, taking the indeterminate as a variable, one can study mathematical structures of polynomials via those of polynomial functions. Thus the theory of polynomials in East Asian mathematics could not be completely materialized. In the previous paper [3], we show that Jeong Yag-yong disclosed in his Gugo Wonlyu(勾股源流) the mathematical structures of Pythagorean polynomials, namely polynomials p(a, b, c) where a, b, c are the three sides gou(勾), gu(股), xian(弦) of a right triangle, respectively. In this paper, we show that Jeong obtained his results through his recognizing Pythagorean polynomials as polynomial functions of three variables a, b, c.

Analysis of the ability to interpret and draw a graph of the function to high school students (고등학생의 함수의 모양 그리기와 해석하는 능력 분석)

  • An, Jong-Su
    • Journal of the Korean School Mathematics Society
    • /
    • v.15 no.2
    • /
    • pp.299-316
    • /
    • 2012
  • In this paper, we examine high school in order to know their ability for understanding about fundamental functions, such as polynomial, trigonometric, logarithm and exponential functions which have learned from high school. The result of this study shows as follows. More than half students are not able to draw shape of given functions, except polynomial. More students do not fully understand about function properties such as domain, codomain, range, maximum and minimum value.

  • PDF

Some Special Cases of a Continuous Time-Cost Tradeoff Problem with Multiple Milestones under a Chain Precedence Graph

  • Choi, Byung-Cheon;Chung, Jibok
    • Management Science and Financial Engineering
    • /
    • v.22 no.1
    • /
    • pp.5-12
    • /
    • 2016
  • We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

Design of Self-Organizing Networks with Competitive Fuzzy Polynomial Neuron (경쟁적 퍼지 다항식 뉴론을 가진 자기 구성 네트워크의 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun;Kim, Hyun-Ki
    • Proceedings of the KIEE Conference
    • /
    • 2000.11d
    • /
    • pp.800-802
    • /
    • 2000
  • In this paper, we propose the Self-Organizing Networks(SON) based on competitive Fuzzy Polynomial Neuron(FPN) for the optimal design of nonlinear process system. The SON architectures consist of layers with activation nodes based on fuzzy inference rules. Here each activation node is presented as FPN which includes either the simplified or regression Polynomial fuzzy inference rules. The proposed SON is a network resulting from the fusion of the Polynomial Neural Networks(PNN) and a fuzzy inference system. The conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as liner, quadratic and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership functions are studied. Chaotic time series data used to evaluate the performance of our proposed model.

  • PDF

REPRESENTATION OF SOME BINOMIAL COEFFICIENTS BY POLYNOMIALS

  • Kim, Seon-Hong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.44 no.4
    • /
    • pp.677-682
    • /
    • 2007
  • The unique positive zero of $F_m(z):=z^{2m}-z^{m+1}-z^{m-1}-1$ leads to analogues of $2(\array{2n\\k}\)$(k even) by using hypergeometric functions. The minimal polynomials of these analogues are related to Chebyshev polynomials, and the minimal polynomial of an analogue of $2(\array{2n\\k}\)$(k even>2) can be computed by using an analogue of $2(\array{2n\\k}\)$. In this paper we show that the analogue of $2(\array{2n\\2}\)$. In this paper we show that the analygue $2(\array{2n\\2}\)$ is the only real zero of its minimal polynomial, and has a different representation, by using a polynomial of smaller degree than $F_m$(z).