• 대한수학회논문집
• /
• 제28권2호
• /
• pp.209-224
• /
• 2013

The problem of finding rational or integral points of an elliptic curve basically boils down to solving a cubic equation. We look closely at the cubic formula of Cardano to find a criterion for a cubic polynomial to have a rational or integral roots. Also we show that existence of a rational root of a cubic polynomial implies existence of a solution for certain Diophantine equation. As an application we find some integral solutions of some special type for $y^2=x^3+b$.

• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.31-38
• /
• 1997

We figure out geometric properties of the Julia set $J_{\alpha}$ of cubic complex polynomial $C_{\alpha}(z)=z^3 + {\alpha}z(\alpha \epsilon \mathbb{C})$ and the smallest ellipse which surrounds $J_{\alpha}$.

• 한국방사선학회논문지
• /
• 제17권7호
• /
• pp.1017-1023
• /
• 2023

The purpose of this study was to improve the accuracy of effective atomic number (EAN) and relative electron density (RED) using a polynomial-based calibration method using dual-energy CT images. A phantom composed of 11 tissue-equivalent materials was acquired with dual-energy CT to obtain low- and high-energy images. Using the acquired dual-energy images, the ratio of attenuation of low- and high-energy images for EAN was calibrated based on Stoichiometric, Quadratic, Cubic, Quartic polynomials. EAN and RED were extracted using each calibration method. As a result of the experiment, the average error of EAN using Cubic polynomial-based calibration was minimum. Even in the RED image extracted using EAN, the error of the Cubic polynomial-based RED was minimum. Cubic polynomial-based calibration contributes to improving the accuracy of EAN and RED, and would like to contribute to accurate diagnosis of lesions in CT examinations or quantification of various materials in the human body.

• Journal of Electrical Engineering and Technology
• /
• 제10권2호
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.320-322
• /
• 2008

We present efficient algorithms for solving the piecewise-cubic approximation problems in the plane. Given a set D of n points in the plane, we find a piecewise-cubic polynomial curve passing through only the points of a subset S of D and approximating the other points using the uniform metric. The goal is to minimize the size of S for a given error tolerance $\varepsilon$, called the min-# problem, or to minimize the error tolerance $\varepsilon$ for a given size of S, called the min-$\varepsilon$ problem. We give algorithms with running times O($n^2$ logn) and O($n^3$) for both problems, respectively.

• 대한기계학회논문집
• /
• 제19권2호
• /
• pp.433-442
• /
• 1995

For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• pp.254-259
• /
• 1998

A new design methology is proposed to identify the structure and parameters of fuzzy model using PNN and a fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Handling), and uses several types of polynomials such as linear, quadratic and cubic besides the biquadratic polynomial used in the GMDH. The FPNN(Fuzzy Polynomial Neural Networks) algorithm uses PNN(Polynomial Neural networks) structure and a fuzzy inference method. In the fuzzy inference method, the simplified and regression polynomial inference methods are used. Here a regression polynomial inference is based on consequence of fuzzy rules with a polynomial equations such as linear, quadratic and cubic equation. Each node of the FPNN is defined as fuzzy rules and its structure is a kind of neuro-fuzzy architecture. In this paper, we will consider a model that combines the advantage of both FPNN and PNN. Also we use the training and testing data set to obtain a balance between the approximation and generalization of process model. Several numerical examples are used to evaluate the performance of the our proposed model.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.675-677
• /
• 1998

In this paper, we propose the fuzzy inference algorithm with multi-layer structure. MFIS(Multi-layer Fuzzy Inference System) uses PNN(Polynomial Neural networks) structure and the fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Hendling), and uses several types of polynomials such as linear, quadratic and cubic, as well as the biquadratic polynomial used in the GMDH. In the fuzzy inference method, the simplified and regression polynomial inference methods are used. Here, the regression polynomial inference is based on consequence of fuzzy rules with the polynomial equations such as linear, quadratic and cubic equation. Each node of the MFIS is defined as fuzzy rules and its structure is a kind of neuro-fuzzy structure. We use the training and testing data set to obtain a balance between the approximation and the generalization of process model. Several numerical examples are used to evaluate the performance of the our proposed model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제28권2호
• /
• pp.59-70
• /
• 2024

In this paper we present the approximation method of the circular helix by G² cubic polynomial curves. The approximants are G¹ Hermite interpolation of the circular helix and their approximation order is four. We obtain numerical examples to illustrate the geometric continuity and the approximation order of the approximants. The method presented in this paper can be extended to approximating the elliptical helix. Using the property of affine transformation invariance we show that the approximant has G² continuity and the approximation order four. The numerical examples are also presented to illustrate our assertions.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제30권4호
• /
• pp.469-497
• /
• 2016

본 연구에서는 추상대수학의 체, 벡터공간, 최소다항식 등의 개념을 중심으로 삼차방정식 해의 작도(불)가능성을 학습할 수 있는 학습 자료와 초등수학적 접근을 구현한 학습 자료를 각각 개발하였다. 그리고 개발된 자료들에 대해 타당성, 학습 가능성, 장점 및 단점을 실험적으로 확인하였다. 본 연구에서 개발된 자료들은 중등학교의 수학 우수학생들, 수학을 배우는 대학생들, 수학교사들에게 유익할 것으로 기대되며, 3대 작도불능문제의 해결, 다양한 3차방정식의 해의 작도(불)가능성을 학습하는데 활용될 수 있을 것으로 기대된다.