• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.443-450
• /
• 2011

In this paper, we construct a Gorenstein Artinian algebra R/J with non-unimodal Hilbert function h = (1, 13, 12, 13, 1) to investigate the algebraic structure of the ideal J in a polynomial ring R. For this purpose, we use a software system Macaulay 2, which is devoted to supporting research in algebraic geometry and commutative algebra.

• 대한수학회지
• /
• 제48권5호
• /
• pp.1065-1081
• /
• 2011

For any field F, a polynomial f $\in$ F[$x_1,x_2,{\ldots},x_k$] can be associated with a polytope, called its Newton polytope. If the polynomial f has integrally indecomposable Newton polytope, in the sense of Minkowski sum, then it is absolutely irreducible over F, i.e., irreducible over every algebraic extension of F. We present some results giving new integrally indecomposable classes of polygons. Consequently, we have some criteria giving many types of absolutely irreducible bivariate polynomials over arbitrary fields.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.261-275
• /
• 2002

Besides asymptotic method, the method of orthogonal polynomials has been used to obtain the solution of the Fredholm integral equation. The principal (singular) part of the kerne1 which corresponds to the selected domain of parameter variation is isolated. The unknown and known functions are expanded in a Chebyshev polynomial and an infinite a1gebraic system is obtained.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• 한국수학사학회지
• /
• 제36권1호
• /
• pp.1-17
• /
• 2023

Paper folding is a versatile tool that can be used not only as a mathematical model for analyzing the geometric properties of plane and spatial figures but also as a visual method for finding the real roots of polynomial equations. The historical evolution of origami's geometric and algebraic techniques has led to the discovery of definitions and properties that can enhance one's cognitive understanding of mathematical concepts and generate mathematical interest and motivation on an emotional level. This paper aims to examine the history of origami geometry, the utilization of origami for solving polynomial equations, and the process of determining the real roots of quadratic, cubic, and quartic equations through origami techniques.

• 대한기계학회논문집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.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.241-251
• /
• 2005

In this paper, we introduce a new algebraic method to characterize rational PH plane curves. And using this method, we study the algebraic characterization of generic strongly regular rational plane PH curves expressed in the complex formalism which is introduced by R.T. Farouki. We prove that generic strongly semi-regular rational PH plane curves are completely characterized by solving a simple functional equation H(f, g) = $h^2$ where h is a complex polynomial and H is a bi-linear operator defined by H(f, g) = f'g - fg' for complex polynomials f,g.

• 조명전기설비학회논문지
• /
• 제20권5호
• /
• pp.116-124
• /
• 2006

비등간격 접지Grid의 설계는 등간격 접지Grid의 설계의 문제점을 극복할 수 있으나 최근까지 국내에서는 적절한 비등간격 접지Grid의 설계방법이나 비등간격 접지Grid 간격결정 방법은 논의되고 있지 않다. 따라서 본 논문에서는 일차함수, 루트함수, 다항함수인 대수함수제어를 통한 비등간격 접지Grid의 수식을 유도하고 최대 Mesh전위와 최소Mesh 전위의 전위차가 2[%] 이내가 되도록 최적의 간격비율을 제시한다.

• 호남수학학술지
• /
• 제30권2호
• /
• pp.323-328
• /
• 2008

In this paper, we introduce some algebraic, rational and polynomial upper bounds of the exponential function on the interval [0,1). And then we compare the acuteness of these bounds.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권3호
• /
• pp.243-291
• /
• 2020

In this paper, multi-block generalized backward differentiation methods for numerical solutions of ordinary differential and differential algebraic equations are introduced. This class of linear multi-block methods is implemented as multi-block boundary value methods (MB₂ VMs). The root distribution of the stability polynomial of the new class of methods are determined using the Wiener-Hopf factorization of a matrix polynomial for the purpose of their correct implementation. Numerical tests, showing the potential of such methods for output of multi-block of solutions of the ordinary differential equations in the new approach are also reported herein. The methods which output multi-block of solutions of the ordinary differential equations on application, are unlike the conventional linear multistep methods which output a solution at a point or the conventional boundary value methods and multi-block methods which output only a block of solutions per step. The MB₂ VMs introduced herein is a novel approach at developing very large scale integration methods (VLSIM) in the numerical solution of differential equations.