• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.529-545
• /
• 2022

This article concerns a ring property that arises from combining one-sided duo factor rings and centers. A ring R is called right CIFD if R/I is right duo by some proper ideal I of R such that I is contained in the center of R. We first see that this property is seated between right duo and right π-duo, and not left-right symmetric. We prove, for a right CIFD ring R, that W(R) coincides with the set of all nilpotent elements of R; that R/P is a right duo domain for every minimal prime ideal P of R; that R/W(R) is strongly right bounded; and that every prime ideal of R is maximal if and only if R/W(R) is strongly regular, where W(R) is the Wedderburn radical of R. It is also proved that a ring R is commutative if and only if D₃(R) is right CIFD, where D₃(R) is the ring of 3 by 3 upper triangular matrices over R whose diagonals are equal. Furthermore, we show that the right CIFD property does not pass to polynomial rings, and that the polynomial ring over a ring R is right CIFD if and only if R/I is commutative by a proper ideal I of R contained in the center of R.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.2
• /
• pp.113-125
• /
• 2007

Improved numerical method to obtain the exact stiffness matrices is newly proposed to perform the spatially coupled elastic and stability analyses of non-symmetric and open/closed thin-walled beam on elastic foundation. This method overcomes drawbacks of the previous method to evaluate the exact stiffness matrix for the spatially coupled stability analysis of thin-walled beam-column This numerical technique is accomplished via a generalized eigenproblem associated with 14 displacement parameters by transforming equilibrium equations to a set of first order simultaneous ordinary differential equations. Next polynomial expressions as trial solutions are assumed for displacement parameters corresponding to zero eigenvalues and the eigenmodes containing undetermined parameters equal to the number of zero eigenvalues are determined by invoking the identity condition. And then the exact displacement functions are constructed by combining eigensolutions and polynomial solutions corresponding to non-zero and zero eigenvalues, respectively. Consequently an exact stiffness matrix is evaluated by applying the member force-deformation relationships to these displacement functions. In order to illustrate the accuracy and the practical usefulness of this study, the numerical solutions are compared with results obtained from the thin-walled beam and shell elements.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1379-1410
• /
• 2017

Kang and Ko introduced a skew-symmetrizable matrix to describe a structure theorem for complete intersections of grade 4. Let $R=k[w_0,\;w_1,\;w_2,\;{\ldots},\;w_m]$ be the polynomial ring over an algebraically closed field k with indetermiantes $w_l$ and deg $w_l=1$, and $I_i$ a homogeneous perfect ideal of grade 3 with type $t_i$ defined by a skew-symmetrizable matrix $G_i(1{\leq}t_i{\leq}4)$. We show that for m = 2 the Hilbert function of the zero dimensional standard k-algebra $R/I_i$ is determined by CI-sequences and a Gorenstein sequence. As an application of this result we show that for i = 1, 2, 3 and for m = 3 a Gorenstein sequence $h(R/H_i)=(1,\;4,\;h_2,\;{\ldots},\;h_s)$ is unimodal, where $H_i$ is the sum of homogeneous perfect ideals $I_i$ and $J_i$ which are geometrically linked by a homogeneous regular sequence z in $I_i{\cap}J_i$.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.33-40
• /
• 2015

The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs $n{\times}n$ ground station data traffic switching has been known NP-hard problem. This paper suggests $O(n^2)$ time complexity algorithm for TSAP of a satellite that performs $n^2{\times}n^2$ ground station data traffic switching. This problem is more difficult than $n{\times}n$ TSAP as NP-hard problem. Firstly, we compute the average traffic for n-transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to $D_{LB}$ traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in $D_{LB}$, then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.1880-1893
• /
• 1994

In this paper, we propose a new shape from shading algorithm which reconstructs object shapes from a single image. In the proposed intative algorithm, given 3D surfaces are approximated by orthogonal polynomials and the relationships between the given surface and its derivatives are constructed ad matrix forms in terms of polynomial coefficients, Also the relative depth and its derivatives are obtained by updating them iteratively. Performance of the propose shape from shading algorithm is evaluated in terms of brightness error, orientation error, and height error, and the performance comparison of the proposed and conventional algorithms is shown.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.137-145
• /
• 1999

In this paper, We consider two-dimensional Maximum Length Cellular Automata (2-D MLCA) as an extension of the 1-D MLCA. 2-D MLCA can display much better random patterns than those generated by 1-D CA and LFSR. To generate random pattern, a CA should have a maximum length cycle. So, it is necessary to find MLCA that the characteristic polynomial of the transition matrix is primitive. New boundary conditions of 3 types are proposed and some rules having primitive polynomials of 2-D MLCA are found.

• Journal of the KSME
• /
• v.26 no.5
• /
• pp.389-393
• /
• 1986

고유치는 여러 공학문제에서 중요하다. 예를들어 비행기의 안전성은 어떤 행렬(matrix)의 고유 치에 의해서 결정된다. 보의 고유진동수는 실제로 행렬의 고유치이다. 좌굴(buckling) 해석도 행렬의 고유치를 구하는 문제이다. 고유치는 여러 수학적인 문제의 해석에서도 자연히 발생한다. 상수계수 일계연립상미분방정식의 해는 그 계수행렬의 고유치로 구할 수 있다. 또한 행렬의 제곱의 수렬 $A,{\;}A^{2},{\;}A^{3},{\;}{\cdots}$의 거동은 A의 고유치로서 가장 쉽게 해석할 수 있다. 이러한 수렬은 연립일차방정식(비선형)의 반복해에서 발생한다. 따라서 이 강좌에서는 행렬의 고유치를 수치적으로 구하는 문제에 대하여 고찰 하고자 한다. 실 또는 보소수 .lambda.가 행렬 B의 고유치라 함은 영이 아닌 벡터 y가 존재하여 $By={\lambda}y$ 가 성립할 때이다. 여기서 벡터 y를 고유치 ${\lambda}$에 속하는 B의 고유벡터라 한다. 윗식은 또 $(B-{\lambda}I)y=0$의 형으로도 써 줄 수 있다. 행렬의 고유치를 수치적으로 구하는 방법에는 여러 가지 방법이 있으나 그 중에서 효과있는 Danilevskii 방법을 소개 하고자 한다. 이 Danilevskii 방법에 의하여 특 성다항식(Characteristic polynomial)을 얻을 수 있고 이 다항식의 근을 얻는 방법 중에 Bairstow 방법 (또는 Hitchcock 방법)이 있는데 이에 대하여 아울러 고찰하고자 한다.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.2107-2117
• /
• 2017

We study the quasi-commutativity in relation with powers of coefficients of polynomials. In the procedure we introduce the concept of ${\pi}$-quasi-commutative ring as a generalization of quasi-commutative rings. We show first that every ${\pi}$-quasi-commutative ring is Abelian and that a locally finite Abelian ring is ${\pi}$-quasi-commutative. The role of these facts are essential to our study in this note. The structures of various sorts of ${\pi}$-quasi-commutative rings are investigated to answer the questions raised naturally in the process, in relation to the structure of Jacobson and nil radicals.

• Korean Journal of Mathematics
• /
• v.15 no.2
• /
• pp.195-206
• /
• 2007

We investigate the multiplicity of $2{\pi}$-periodic solutions of the nonlinear Hamiltonian system with perturbed polynomial and exponential potentials, $\dot{z}= JG^{\prime}(z)$, where $z:R{\rightarrow}R^{2n}$, $\dot{z}={\frac{dz}{dt}}$, $J=\(\array{0&-I\\I&0}\)$, I is the identity matrix on $R^n,G:R^{2n}{\rightarrow}R$, G(0, 0) = 0 and $G^{\prime}$ is the gradient of G. We look for the weak solutions $z=(p,q){\in}E$ of the nonlinear Hamiltonian system.