• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.1
• /
• pp.49-66
• /
• 2022

The G-Euler process has been proposed to overcome the difficulties of the calculation of the exponential function of the Jacobian. It is an explicit method that uses the exponential function of the scalar skew-symmetric matrix. We define the moving shapes of true solutions and the moving shapes of numerical solutions. It is discussed whether the moving shape of the numerical solution matches the moving shape of the true solution. The match rates of these two kinds of moving shapes are sequentially calculated by the G-Euler process without using the true solution. It is shown that the closer the minimum match rate is to 100%, the more closely the numerical solutions follow the true solutions to the end. The minimum match rate indicates the reliability of the numerical solution calculated by the G-Euler process. The graphs of the Lorenz system in Perko [1] are different from those drawn by the G-Euler process. By the way, there is no basis for claiming that the Perko's graphs are reliable.

• Steel and Composite Structures
• /
• v.3 no.6
• /
• pp.439-450
• /
• 2003

The finite strip transition matrix technique, a semi analytical method, is employed to obtain the buckling loads and the natural frequencies of symmetric cross-ply laminated composite plates with edges elastically restrained against both translation and rotation. To illustrate the accuracy and the validation of the method several example of cross play laminated composite plates were analyzed. The buckling loads and the frequency parameters are presented and compared with available results in the literature. The convergence study and the excellent agreement with known results show the reliability of the purposed technique.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.111-118
• /
• 2015

In this paper, we propose an extended SOR (ESOR) method with diagonal preconditioners for solving symmetric positive definite linear systems, and then we provide convergence results of the ESOR method. Lastly, we provide numerical experiments to evaluate the performance of the ESOR method with diagonal preconditioners.

• The Pure and Applied Mathematics
• /
• v.17 no.1
• /
• pp.107-113
• /
• 2010

In this paper, we study the root system of rank 2 symmetric hyperbolic Kac-Moody algebras. We give the sufficient conditions for existence of imaginary roots of square length -2k ($k\;{\in}\;\mathbb{Z}$>0). We also give several relations between the roots on g(A).

• The Journal of Korea Robotics Society
• /
• v.4 no.2
• /
• pp.88-96
• /
• 2009

In this paper, we present a linear controller for attitude of aircraft. We use a rotational matrix in one approach and a quaternion in the other approach. We also find some interesting mathematical properties concerning a symmetric rotational matrix and we use these properties to analyze the stability of the proposed control law. We find that the quaternion approach is better than rotational matrix approach because there exists no singular region problem in quaternion approach. On the other hand, singular region problem may happens in rotational matrix approach. The controller structure of the quaternion is also very simple compared with the one proposed by using a rotational matrix approach. We make use Matlab Simulink to simulate and illustrate the theoretical claims. The graphic animation program is developed based on Open-GL for the computer simulation of the proposed control algorithm.

• Tunnel and Underground Space
• /
• v.10 no.2
• /
• pp.173-179
• /
• 2000

The influence of the plastic flow rules on the elasto-plastic behaviour of a discrete joint element was investigated by performing the numerical direct shear tests under both constant normal displacement and normal displacement conditions. The finite interface elements obeying Plesha’s joint constitutive law was used to allow the relative motion of the rock blocks on the joint surface. Realistic results were obtained in the tests adopting the non-associated flow rule, while the associated flow rule overestimated the joint dilation. To overcome the computational drawbacks coming from the non-symmetric element stiffness matrix in the conventional non-associated plasticity, the symmetric formulation of the tangential stiffness matrix for a non-associated joint element was proposed. The symmetric elasto-plastic matrix it derived by assuming an imaginary equivalent joint with associated flow rule which shows the same plastic response as that of original Joint with non-associated flow rule. The validity of the formulation was confirmed through the numerical direct shear tests under constant normal stress condition.

• Journal of Digital Contents Society
• /
• v.10 no.4
• /
• pp.579-585
• /
• 2009

In [9], Tyrtshnikov proposed a preconditioned approach to derive a general solution from a Toeplitz linear system. Furthermore, the process of selecting a preconditioner matrix from symmetric Toeplitz matrix, which has been used in previous studies, is introduced. This research introduces a new method for finding the preconditioner in a Toeplitz system. Also, through analyzing these preconditioners, it is derived that eigenvalues of a symmetric Toeplitz are very close to eigenvalues of a new preconditioner for T. It is shown that if the spectrum of the preconditioned system $C_0^{-1}T$ is clustered around 1, then the convergence rate of the preconditioned system is superlinear. From these results, it is determined to get the superliner at the convergence rate by our good preconditioner $C_0$. Moreover, an advantage is driven by increasing various applications i. e. image processing, signal processing, etc. in this study from the proposed preconditioners for Toeplitz matrices. Another characteristic, which this research holds, is that the preconditioner retains the properties of the Toeplitz matrix.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.68-72
• /
• 1983

The Hadamard matrix is a symmetric matrix made of plus and minus ones as entries. There fore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, However, certain degradation aspects have been reported. In this paper we propose a WH matrix which retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assigment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of $\pm$1, $\pm$2, $\pm$3, and the unitform is 8$\times$8 matrix.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.