• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.333-342
• /
• 2008

Variable selection theorem in the linear regression model is extended to the analysis of covariance model. When some of regression variables are omitted from the model, it reduces the variance of the estimators but introduces bias. Thus an appropriate balance between a biased model and one with large variances is recommended.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.1-9
• /
• 2021

OpenGL compute shader is a shader stage that operate differently from other shader stage and it can be used for the calculating purpose of any data in parallel. This paper proposes a GPU-based parallel algorithm for computing sparse linear systems through conjugate gradient using an iterative method, which perform calculation on OpenGL compute shader. Basically, this sparse linear solver is used to solve large linear systems such as symmetric positive definite matrix. Four well-known matrix formats (Dense, COO, ELL and CSR) have been used for matrix storage. The performance comparison from our experimental tests using eight sparse matrices shows that GPU-based linear solving system much faster than CPU-based linear solving system with the best average computing time 0.64ms in GPU-based and 15.37ms in CPU-based.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.634-639
• /
• 2020

In general, the stability and response characteristics of the system can be improved by changing the pole position because a nonlinear system can be linearized by the product of a 1st and 2nd order system. Therefore, a controller that moves the pole can be designed in various ways. Among the other methods, LQ control ensures the stability of the system. On the other hand, it is difficult to specify the location of the pole arbitrarily because the desired response characteristic is obtained by selecting the weighting matrix by trial and error. This paper evaluated a method of selecting a weighting matrix of LQ control that moves multiple double poles with Jordan blocks to real poles. The relational equation between the double poles and weighting matrices were derived from the characteristic equation of the Hamiltonian system with a diagonal control weighting matrix and a state weighting matrix represented by two variables (ρ_d, ϕ_d). The Moving-Range was obtained under the condition that the state-weighting matrix becomes a positive semi-definite matrix. This paper proposes a method of selecting poles in this range and calculating the weighting matrices by the relational equation. Numerical examples are presented to show the usefulness of the proposed method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.1
• /
• pp.25-32
• /
• 2017

Most of weapon systems use aided navigation system which integrates inertial navigation and aiding sensors to compensate the INS errors increasing with the passage of time. Various aid sensors can be applied such as Global Navigation Satellite System (GNSS), radar, barometer, etc., but there might exist time delay caused by signal processing or transferring aid information. This time delay leads out-of-sequence measurements (OOSM) systems. Previously, optimal and suboptimal measurment update method for OOSM systems, where the time delay length are known, are proposed. However, previous algorithm does not guarantee the positive definite property of covariance matrix. In order to improve numerical stability for aided navigation using delayed-measurement, this paper proposes a new measurement covariance update algorithm be similar to Joseph-form in Kalman filter. Futhermore, we propose how to implement it in indirect feedback Kalman filter structure, which is commonly used in aided navigation systems, for time-delayed measurement systems. Simulation and vehicle test results show effectiveness of a proposed algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.63-69
• /
• 2001

In this study, we shall be concerned with computing in parallel a few of the smallest eigenvalues and their corresponding eigenvectors of the eigenvalue problem, $Ax={\lambda}Bx$, where A is symmetric, and B is symmetric positive definite. Both A and B are large and sparse. Recently iterative algorithms based on the optimization of the Rayleigh quotient have been developed, and CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for small extreme eigenvalues. As in the case of a system of linear equations, successful application of the CG scheme to eigenproblems depends also upon the preconditioning techniques. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. The idea underlying the present work is a parallel computation of the Multi-Color Block SSOR preconditioning for the CG optimization of the Rayleigh quotient together with deflation techniques. Multi-Coloring is a simple technique to obatin the parallelism of order n, where n is the dimension of the matrix. 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 problems were drawn from the discretizations of partial differential equations by finite difference methods.