• 한국수학사학회지
• /
• 제29권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.

• 대한전자공학회논문지
• /
• 제25권10호
• /
• pp.1166-1172
• /
• 1988

본 논문의 Taylor 다항식에 의해 선형 시변 시스템을 해석하는 한 효과적인 방법을 제안한다. Sparis와 Mouroutsos에 의한 방법은 구해야 할 상태 벡타가 닫혀진 형태(closed form)로 구해지지 않고 또한 사용하는 항이 증가할 때 큰 차원의 선형 대수 방정식을 출어야 하는 문제점을 가지고 있다. 반면에 본 논문에서 제안된 방법은 상태 벡타가 닫혀진 형태로 구해지며 선형 대수 방정식을 풀 필요가 없다.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제29권4호
• /
• pp.661-685
• /
• 2015

본 연구는 수학교사의 전문성을 신장시킬 수 있는 구체적인 가능성을 탐색하는 연구로, 다항식의 해법에 대한 수학교사의 대수 내용지식을 선정하고, 선정된 내용지식을 바탕으로 수학교사의 자립연수를 위한 학습 자료를 개발하였다. 개발된 학습 자료는 수학교사들에게 제공되었으며, 학습 자료가 자립연수에서 활용 가능한지, 수학교사들이 이해 가능한지 등에 대해 검사지로 조사하였고, 연수 방법 및 내용에 대해서도 설문을 하였다. 교사들의 대답을 분석한 결과, 개발된 학습 자료는 자립연수의 활용 가능성, 교사들의 이해 가능성, 연수 방법에 대해 긍정적인 결과를 얻었다.

• 한국수학사학회지
• /
• 제28권6호
• /
• pp.301-310
• /
• 2015

Since Jiuzhang Suanshu, the main tools in the theory of right triangles, known as Gougushu in East Asia were algebraic identities about three sides of a right triangle derived from the Pythagorean theorem. Using tianyuanshu up to siyuanshu, Song-Yuan mathematicians could skip over those identities in the theory. Chinese Mathematics in the 17-18th centuries were mainly concerned with the identities along with the western geometrical proofs. Jeong Yag-yong (1762-1836), a well known Joseon scholar and writer of the school of Silhak, noticed that those identities can be derived through algebra and then wrote Gugo Wonlyu (勾股源流) in the early 19th century. We show that Jeong reveals the algebraic structure of polynomials with the three indeterminates in the book along with their order structure. Although the title refers to right triangles, it is the first pure algebra book in Joseon mathematics, if not in East Asia.

• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.529-537
• /
• 2014

The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

• 대한수학회지
• /
• 제49권1호
• /
• pp.99-112
• /
• 2012

This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

• 대한수학회보
• /
• 제53권3호
• /
• pp.699-709
• /
• 2016

Our paper is devoted to the study of certain diophantine equations on the ring of polynomials over a finite field, which are intimately related to algebraic formal power series which have partial quotients of unbounded degree in their continued fraction expansion. In particular it is shown that there are Pisot formal power series with degree greater than 2, having infinitely many large partial quotients in their simple continued fraction expansions. This generalizes an earlier result of Baum and Sweet for algebraic formal power series.

• 대한수학회보
• /
• 제53권1호
• /
• pp.1-20
• /
• 2016

The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge numbers) is to select a nonlinear polynomial for algebraic sieving and a linear polynomial for rational sieving. There is another method called a nonlinear method which selects two polynomials of the same degree greater than one. In this paper, we generalize Montgomery's method [12] using geometric progression (GP) (mod N) to construct a pair of nonlinear polynomials. We also introduce GP of length d + k with $1{\leq}k{\leq}d-1$ and show that we can construct polynomials of degree d having common root (mod N), where the number of such polynomials and the size of the coefficients can be precisely determined.

• International Journal of Control, Automation, and Systems
• /
• 제2권3호
• /
• pp.319-332
• /
• 2004

This paper proposes some further improvements on N.K. Bose's 2D stability test for polynomials with real coefficients by revealing symmetric properties of the polynomials, resultants occurring in the test and by generalizing Sturm's method. The improved test can be fulfilled by a totally algebraic algorithm with a finite number of steps and the computational complexity is largely reduced as it involves only certain real variable polynomials with degrees not exceeding half of their previous complex variable counterparts. Nontrivial examples for 2D polynomials having both numerical and literal coefficients are also shown to illustrate the computational advantage of the proposed method.

• 대한수학회지
• /
• 제34권4호
• /
• pp.973-1008
• /
• 1997

We reconsider the problem of calssifying all classical orthogonal polynomial sequences which are solutions to a second-order differential equation of the form $$ \ell_2(x)y"(x) + \ell_1(x)y'(x) = \lambda_n y(x). $$ We first obtain new (algebraic) necessary and sufficient conditions on the coefficients $\ell_1(x)$ and $\ell_2(x)$ for the above differential equation to have orthogonal polynomial solutions. Using this result, we then obtain a complete classification of all classical orthogonal polynomials : up to a real linear change of variable, there are the six distinct orthogonal polynomial sets of Jacobi, Bessel, Laguerre, Hermite, twisted Hermite, and twisted Jacobi.cobi.