• East Asian mathematical journal
• /
• 제28권5호
• /
• pp.587-595
• /
• 2012

In this paper we consider the quadratic matrix equation which can be defined be $$Q(X)=AX^2+BX+C=0$$, where X is a $n{\times}n$ unknown real matrix; A,B and C are $n{\times}n$ given matrices with real elements. Newton's method is considered to find the skew-symmetric solvent of the nonlinear matrix equations Q(X). We also show that the method converges the skew-symmetric solvent even if the Fr$\acute{e}$chet derivative is singular. Finally, we give some numerical examples.

• 충청수학회지
• /
• 제26권2호
• /
• pp.275-285
• /
• 2013

In this paper a nonlinear matrix equation is considered which has the form $$P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_{m-1}X+A_m=0$$ where X is an $n{\times}n$ unknown real matrix and $A_m$, $A_{m-1}$, ${\cdots}$, $A_0$ are $n{\times}n$ matrices with real elements. Newtons method is applied to find the skew-symmetric solvent of the matrix polynomial P(X). We also suggest an algorithm which converges the skew-symmetric solvent even if the Fr$\acute{e}$echet derivative of P(X) is singular.

• 한국통신학회논문지
• /
• 제25권10A호
• /
• pp.1560-1565
• /
• 2000

Over an additive abelian group G of order g and for a given positive integer λ, a generalized Hadamard matrix GF(g,λ) is defined as a gλ$\times$gλ matrix [h(i,j)] where 1$\leq$i$\leq$gλ,1$\leq$j$\leq$gλ, such that every element of G appears exactly λ times in the list h(i$_1$,1)-h(i$_2$,1), h(i$_1$,2)-h(i$_2$,2),...,h(i$_1$,gλ)-h(i$_2$, gλ) for any i$\neq$j. In this paper, we propose a new method of expanding a GH(\ulcorner,λ$_1$) = B = \ulcorner over G by replacing each of its m-tuple \ulcorner with \ulcorner GH(g,λ$_2$) where m=gλ$_2$. We may use \ulcornerλ$_1$(not necessarily all distinct) GH(g,λ$_2$)'s for the substitution and the resulting matrix is defined over the group of order g.

• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.860-870
• /
• 2005

본 논문에서는 karnaugh map(k-map)상의 셀을 이용하여 $2^{n}$개의 서로 다른 극수(polarity)를 갖는 GRM(Generalized Reed-Muller)상수를 생성하는 새로운 기법을 제안하였다. n개의 입력변수에 대한 일반적인 GRM 함수의 생성 방법은 단일 변수에 대한 변환 행렬을 구하고 이를 n번의 Kronecker 곱을 행한 변환 행렬을 이용하여 GRM 상수를 구하는 것이다. 이런 방법을 사용하는 경우, 변수의 숫자가 증가함에 따라 변환 행렬의 차수가 $2^{n}\times2^{n}$로 커지는 단점을 갖는다. 이에 반하여 본 논문에서는 k-map상에서 변수를 축약시킨 셀 [$f_{i}$]을 구하고 이를 단일 변수 변환 행렬과 연산하여 GBM 상수를 구하는 새로운 기법을 제안한다. 본 논문에서 제안한 새로운 방법과 타 논문과의 비교를 한 결과, 기존 방법은 가산기, 승산기, KP(Kronecker 곱 승산기)회로가 필요한데 반하여 본 논문에서는 가산기만이 필요하므로 효율적인 VLSI 설계에 유리하다

• 대한수학회지
• /
• 제32권3호
• /
• pp.461-470
• /
• 1995

In this paper a capacitance matrix method is developed for the Poisson equation on a rectangle $$ (1-1) Lu \equiv -(u_{xx} + u_{yy} = f, (x, y) \in \Omega \equiv (0, 1) \times (0, 1) $$ with the homogeneous Dirichlet boundary condition $$ (1-2) u = 0, (x, y) \in \partial\Omega $$ where $\partial\Omega$ is the boundary of the region $\Omega$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.113-124
• /
• 2010

We consider matrix polynomial which has the form $P_1(X)=A_oX^m+A_1X^{m-1}+...+A_m=0$ where X and $A_i$ are $n{\times}n$ matrices with real elements. In this paper, we propose an iterative method for the symmetric and generalized centro-symmetric solution to the Newton step for solving the equation $P_1(X)$. Then we show that a symmetric and generalized centro-symmetric solvent of the matrix polynomial can be obtained by our Newton's method. Finally, we give some numerical experiments that confirm the theoretical results.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 1991년도 추계학술대회 논문집
• /
• pp.48-51
• /
• 1991

Short channel Nonvolatile EEPROM memory devices were fabricated to CMOS 1M bit design rule, and reviews the characteristics and applications of SNOSFET. Application of SNOS field effect transistors have been proposed for both logic circuits and nonvolatile memory arrays, and operating characteristics with write and erase were investigated. As a results, memory window size of four terminal devices and two terminal devices was established low conductance stage and high conductance state, which was operated in “1” state and “0”state with write and erase respectively. And the operating characteristics of unit cell in matrix array were investigated with implementing the composition method of four and two terminal nonvolatile memory cells. It was shown that four terminal 2${\times}$2 matrix array was operated bipolar, and two termineal 2${\times}$2 matrix array was operated unipolar.

• 충청수학회지
• /
• 제25권1호
• /
• pp.19-25
• /
• 2012

The purpose of this paper is to derive powers $A^{n}$ using a system of recursive sequences for a given $2{\times}2$ matrix A. Introducing a recursive sequence we have a quadratic equation. Solutions to this quadratic equation are related with eigenvalues of A. By solving this quadratic equation we can easily obtain an explicit form of $A^{n}$. Our method holds when A is defined not only on the real field but also on the complex field.

• 정보통신설비학회논문지
• /
• 제10권1호
• /
• pp.7-13
• /
• 2011

Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

• Journal of Biosystems Engineering
• /
• 제32권6호
• /
• pp.389-394
• /
• 2007

The power output of the stirling engine is influenced by the regenerator effectiveness. The regenerator effectiveness is influenced by heat transfer and flow friction loss of the regenerator matrix. In this paper, in order to provide basic data for the design of the regenerator matrix, characteristics of working fluid velocities were investigated by a packed method of matrix in the oscillating flow as the same condition of operation in a Stirling engine. As matrices, two different wire screens were used. The results are summarized as follows; 1. When a regenerator is not filled with any wire screen, working fluid velocity of the oscillating flow shows 1.3 times faster than that of one directional flow. 2. When a regenerator is filled with the wire screen of No.50, working fluid velocity of the oscillating flow reveals 2.5 times faster than that of one directional flow. 3. When a regenerator is filled with the wire screen of No. 100, working fluid velocity of the oscillating flow shows 2 times faster than that of one directional flow, regardless of the number of packed wire screens. 4. Working fluid velocity is decreased wire the increase in number of meshes and packed wire screens.