• 대한수학회보
• /
• 제39권3호
• /
• pp.495-509
• /
• 2002

We propose variants of the modified incomplete Cho1esky factorization preconditioner for a symmetric positive definite (SPD) matrix. Spectral properties of these preconditioners are discussed, and then numerical results of the preconditioned CG (PCG) method using these preconditioners are provided to see the effectiveness of the preconditioners.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 B
• /
• pp.862-864
• /
• 2001

In this paper, we developed the algorithm for assembling and iterative numerical analyzing of non-symmetric sparse matrix equation in finite element method. Developed program in this study is applicable and very useful to analyze the electromagnetic characteristics of the electric machinery considered with the movement of the secondary.

• 대한수학회보
• /
• 제52권2호
• /
• pp.409-419
• /
• 2015

The concept of Cayley-symmetric semigroups is introduced, and several equivalent conditions of a Cayley-symmetric semigroup are given so that an open problem proposed by Zhu [19] is resolved generally. Furthermore, it is proved that a strong semilattice of self-decomposable semigroups $S_{\alpha}$ is Cayley-symmetric if and only if each $S_{\alpha}$ is Cayley-symmetric. This enables us to present more Cayley-symmetric semi-groups, which would be non-regular. This result extends the main result of Wang [14], which stated that a regular semigroup is Cayley-symmetric if and only if it is a Clifford semigroup. In addition, we discuss Cayley-symmetry of Rees matrix semigroups over a semigroup or over a 0-semigroup.

• Journal of Magnetics
• /
• 제18권2호
• /
• pp.130-134
• /
• 2013

Most electrical machines like motor, generator and transformer are symmetric in terms of magnetic field distribution and mechanical structure. In order to analyze these problems effectively, many coupling techniques have been introduced. This paper deals with a coupling scheme for open boundary problem of symmetric and periodic structure. It couples an analytical solution of Fourier series expansion with the standard finite element method. The analytical solution is derived for the magnetic field in the outside of the boundary, and the finite element method is for the magnetic field in the inside with source current and magnetic materials. The main advantage of the proposed method is that it retains sparsity and symmetry of system matrix like the standard FEM and it can also be easily applied to symmetric and periodic problems. Also, unknowns of finite elements at the boundary are coupled with Fourier series coefficients. The boundary conditions are used to derive a coupled system equation expressed in matrix form. The proposed algorithm is validated using a test model of a bush bar for the power supply. And the each result is compared with analytical solution respectively.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 추계학술발표대회
• /
• pp.768-770
• /
• 2013

We propose a symmetric key based cryptography algorithm to encode and decode the text data with limited length using 3-dimensional magic square matrix. To encode the plain text message, input text will be translated into an index of the number stored in the key matrix. Then, Caesar's shift with pre-defined constant value is fabricated to finalize an encryption algorithm. In decode process, Caesar's shift is applied first, and the generated key matrix is used with 2D magic squares to replace the index numbers in ciphertext to restore an original text.

• 대한전자공학회논문지
• /
• 제21권4호
• /
• pp.7-12
• /
• 1984

DFT로 대각선화 할 수 있는 circulant matrix가 대칭이고 실수인 경우에 이를 대각선화 할 수 있는 CDFT(composite DFT)를 유도했다. 일반적인 실수 신호의 대칭 covariance matrix에 대하여 DFT와 CDFT 변환했을 경우의 variance 분포를 분석했고, 이를 토대로 rate distortion 이론에 의하여 이들의 성능을 비교한 결과 CDFT가 DFT보다 bit rate면에서 효과적임을 볼 수 있었다. 그리고 f(q)=(0.95)q인 covariance matrix(64×64)에 대해 CDFT가 DFT에 비해. 계산결과, 평균적으로 0.0095bit가 감소될 수 있었다.

• 한국전자통신학회논문지
• /
• 제15권6호
• /
• pp.1105-1112
• /
• 2020

1차원 3-이웃 셀룰라 오토마타(Cellular Automata, 이하 CA) 기반의 의사난수 생성기는 시스템의 성능을 평가하기 위한 테스트 패턴 생성과 암호 시스템의 키수열 생성기 등에 많이 응용되고 있다. 본 논문에서는 더 복잡하고 혼돈스러운 수열을 생성할 수 있는 CA기반의 키 수열 생성기를 설계하기 위해 각 셀의 상태전이에 영향을 주는 이웃을 5개로 확장한 1차원 대칭 5-이웃 CA에 대해 연구한다. 특히 대칭 5-이웃 CA를 합성하기 위해 Krylov 행렬을 이용하는 대수적인 방법과 Cho et al.의 알고리즘을 기반으로 한 1차원 n셀 대칭 5-이웃 CA 합성 알고리즘을 제안한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권2호
• /
• pp.5-16
• /
• 1999

We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.839-850
• /
• 2008

In this paper, the symmetric accelerated overrelaxation (SAOR) method for solving $n{\times}n$ fuzzy linear system is discussed, then the convergence theorems in the special cases where matrix S in augmented system SX = Y is H-matrices or consistently ordered matrices and or symmetric positive definite matrices are also given out. Numerical examples are presented to illustrate the theory.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.703-715
• /
• 2021

There are several methods for constructing self-dual codes. Among them, the building-up construction is a powerful method. Recently, Kim and Choi proposed special building-up constructions which use symmetric generator matrices for self-dual codes over GF(q), where q is odd. In this paper, we study the same method when q is even.