• 대한기계학회논문집A
• /
• 제24권1호
• /
• pp.225-231
• /
• 2000

Dimensional synthesis of planar and spatial mechanisms mostly requires solution-finding, procedure for a system of polynomial equations. In case the system is nonlinear, numerical techniques like Newton-Raphson are often used. But there are no logical ways for finding all possible solutions in such iterative methods. In this paper, algebraic elimination is used to get all solutions for the synthesis of 5-SS spatial mechanism with seven prescribed positions. The proposed algorithm is more suitable for computer implementation and takes less time than existing one. Two numerical examples are given to demonstrate the implemented algorithm.

• 대한수학회논문집
• /
• 제34권1호
• /
• pp.113-125
• /
• 2019

In this paper, we introduce the elimination ideal $I_D(G)$ associated to a simple finite graph G. We obtain the upper bound of Castelnuovo-Mumford regularity of elimination ideal for various classes of graphs.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• pp.541-547
• /
• 2000

This paper presents the closed-form forward kinematics of the 6-6 Stewart platform of planar base and moving platform. Based on algebraic elimination method and with one extra linear sensor, it first derives an 8th-degree univariate equation and then finds tentative solution sets out of which the actual solution is to be selected. In order to provide more exact solution despite the error between measured sensor value and the theoretical one, a correction method is also used. The overall procedure requires so little computation time that it can be efficiently used for realtime applications. In addition, unlike the iterative schemes e.g. Newton-Raphson, the algorithm does not require initial estimates of solution and is free of the problems that it does not converge to actual solution within limited time. The presented method has been implemented in C language and a numerical example is given to confirm the effectiveness and accuracy of the developed algorithm.

• 전자공학회논문지B
• /
• 제30B권9호
• /
• pp.18-26
• /
• 1993

This paper presents a multiplier free technique for the complex DFT by rotations and additions based on the complex approximation of the ring of algebraic integers. Speeding-up the computation time and reducing the dynamic range growth has been achieved by the elimination of multiplication. Moreover the DFT of no twiddle factor quantization errors is possible. Numerical examples are given to prove the algorithm and the applicable size of the DFT is 16 has been concluded.

• 대한기계학회논문집A
• /
• 제25권9호
• /
• pp.1384-1390
• /
• 2001

This paper deals with the forward kinematics of the 6-6 Stewart platform of planar base and moving platform using one extra linear sensor. Based on algebraic elimination method, it first derives an 8th-degree univariate equation and then finds tentative solution sets out of which the actual solution is to be selected. In order to provide more exact solution despite the error between measured sensor value and the theoretic alone, a correction method is also used in this paper. The overall procedure requires so little computation time that it can be efficiently used for real-time applications. In addition, unlike the iterative scheme e.g. Newton-Raphson, the algorithm does not require initial estimates of solution and is free of the problems that it does not converge to actual solution within limited time. The presented method has been implemented in C language and a numerical example is given to confirm the effectiveness and accuracy of the developed algorithm.

• 한국통신학회논문지
• /
• 제13권6호
• /
• pp.529-534
• /
• 1988

본 논문에서는 PWM인버터의 임의의 고조파를 제거할 때 프리에급수를 이용하여 비선형 연립방정식을 선형 연립방정식으로 바꾸던 것을 왈쉬급수를 이용하여 임의의 고조파를 제거하는 새로운 방법을 제시하였다. PWM인버터의 고조파제거에서 왈쉬급수를 이용하여 파형을 분석하고, 왈쉬급수와 프리에급수를 이용하여 비교 분석하였으며, 또한 단상 PWM인버터의 출력파혀을 왈쉬급수를 이용하여 시뮬레이션하고 실험을 통하여 임의의 고조파가 제거됨을 확인한다.

• 충청수학회지
• /
• 제32권1호
• /
• pp.15-21
• /
• 2019

Let X be a reduced closed subscheme in ${\mathbb{P}}^n$ and $${\pi}_q:X{\rightarrow}Y={\pi}_q(X){\subset}{\mathbb{P}}^{n-1}$$ be an isomorphic projection from the center $q{\in}{\mathbb{P}}^n{\backslash}X$. Suppose that the minimal free presentation of $I_X$ is of the following form $$R(-3)^{{\beta}2,1}{\oplus}R(-4){\rightarrow}R(-2)^{{\beta}1,1}{\rightarrow}I_X{\rightarrow}0$$. In this paper, we prove that $H^1(I_X(k))=H^1(I_Y(k))$ for all $k{\geq}3$. This implies that Y is k-normal if and only if X is k-normal for $k{\geq}3$. Moreover, we also prove that reg(Y) ${\leq}$ max{reg(X), 4} and that $I_Y$ is generated by homogeneous polynomials of degree ${\leq}4$.

• 대한수학교육학회지:학교수학
• /
• 제17권3호
• /
• pp.407-421
• /
• 2015

본 연구에서는 연립일차방정식에 대한 교사의 수학 전문성 신장을 위하여 연립일차방정식의 다양한 표현을 탐색하고, 그 해결 방법인 소거법의 의미를 분석했다. 연립일차방정식은 언어적 표현, 직사각형 표현, 방정식 표현, 직선(또는 그래프) 표현, 첨가행렬 표현, 행렬 표현, 일차결합(또는 벡터) 표현으로 나타낼 수 있다. 직사각형 표현은 계수가 자연수이고 해가 양인 값을 찾는데 유용하다. 직선 표현에서 기울기와 절편을 Cramer의 공식과 연결시켜 줄 수 있다. 한 미지수를 소거하는 것은 축이나 축에 평행한 직선의 방정식을 구하고, 그것을 사용하여 다른 축이나 축에 평행한 직선으로 바꾸는 것이다. 이런 점에서 가감법이라는 대수적 절차를 직선을 사용하여 시각적으로 이미지화할 수 있다. 일차방정식의 해법에서 사용하는 방정식의 일차결합은 직선족과 방향벡터로 바꾸어 생각할 수 있다.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제53권7호
• /
• pp.430-436
• /
• 2004

This paper presents an advanced control technique for power density maximization of the Brushless DC (BLDC) generator by using the linear tracking method. In a generator of given rating, the weight and size of the system affect the fuel consumption directly. Therefore, power density is one of the most important issues in a stand-alone generator. BLDC generator has high power density in the machine point of view and additional increases of power density by control means can be expected. Conventional rectification methods cannot achieve the maximum power possible because of hon-optimal current waveforms. The optimal current waveform to maximize power density and minimize machine size and weight in a nonsinusoidal power supply system has been derived, incorporated in a control system, and verified by simulation and experimental work. A new simple algebraic method has been proposed to accomplish the proposed control without an FFT which is time consuming and complicated.

• 충청수학회지
• /
• 제34권2호
• /
• pp.181-188
• /
• 2021

Let X be a nondegenerate reduced closed subscheme in ℙⁿ. Assume that π_q : X → Y = π_q(X) ⊂ ℙ^n-1 is a generic projection from the center q ∈ Sec(X) \ X where Sec(X) = ℙⁿ. Let Z be the singular locus of the projection π_q(X) ⊂ ℙ^n-1. Suppose that I_X has the almost minimal presentation, which is of the form R(-3)^β_2,1 ⊕ R(-4) → R(-2)^β_1,1 → I_X → 0. In this paper, we prove the followings: (a) Z is either a linear space or a quadric hypersurface in a linear subspace; (b) $H^1({\mathcal{I}_X(k)})=H^1({\mathcal{I}_Y(k)})$ for all k ∈ ℤ; (c) reg(Y) ≤ max{reg(X), 4}; (d) Y is cut out by at most quartic hypersurfaces.