• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.305-326
• /
• 2001

We introduce a class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. This techniques is based on a recursive two by two block incomplete LU factorization on the coefficient martix. The coarse level system is constructed as an (approximate) Schur complement. A dynamic preconditioner is obtained by solving the Schur complement matrix approximately. The novelty of the proposed techniques is to solve the Schur complement matrix by a preconditioned Krylov subspace method. Such a reduction process is repeated to yield a multilevel recursive preconditioner.

• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.963-977
• /
• 2011

PCA(Principal Component Analysis) is a well-studied statistical technique and an important tool for handling multivariate data. Although many algorithms exist for PCA, most of them are unsuitable for real time applications or high dimensional problems. Since it is desirable to avoid extensive matrix operations in such cases, alternative solutions are required to calculate the eigenvalues and eigenvectors of the sample covariance matrix. Erdogmus et al. (2004) proposed Recursive PCA(RPCA), which is a fast adaptive on-line solution for PCA, based on the first order perturbation theory. It facilitates the real-time implementation of PCA by recursively approximating updated eigenvalues and eigenvectors. However, the performance of the RPCA method becomes questionable as the size of newly-added data increases. In this paper, we modified the RPCA method by taking advantage of the mathematical relation of eigenvalues and eigenvectors of sample covariance matrix. We compared the performance of the proposed algorithm with that of RPCA, and found that the accuracy of the proposed method remarkably improved.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.224-229
• /
• 2012

In this paper, we propose a correction method for astronomical telescope using recursive least square method. There are two ways to move a telescope : equatorial operation and altazimuth operation. We must align polar axis of a equatorial telescope with the north celestial pole and adjust the horizontal axis of a altazimuth telescope exactly to match the celestial coordinate system with the telescope coordinate system. This process needs time and expertise. We can skip existing process and correct a tracking error easily by deriving the relationship of the celestial coordinate system and the telescope coordinate system using the proposed correction method. We obtain the coordinate of a celestial body in the celestial coordinate system and the telescope coordinate system and derive a transformation matrix through the obtained coordinate. We use recursive least square method to estimate the unknown parameters of a transformation matrix. Finally, we implement a telescope control system using a microprocessor and verify the performance of the correction method. Through an experiment, we show the validity of the proposed correction method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.12
• /
• pp.1384-1393
• /
• 2008

In this paper, we analyzed the multilayer structure with lossy metamaterials using ABCD Matrix method to get the transmission characteristics. Compared to the recursive method which cannot be used to analyze the lossy characteristics of multilayer structure because of its complexity, we used the ABCD matrix method is easy to apply because of its matrix chain concepts for arbitrary number of multilayer structure and lossy material. To verify the results of this paper, we used both for multilayer dielectric and metamaterial, respectively, and obtained the same results. Multilayer structure with lossy metamaterial showed minimized ripple and broadband transmission compared to dielectric multilayered structure. This can be used in various applications as antenna radome and shielding material, etc.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2E
• /
• pp.43-48
• /
• 2006

Abstract-Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. Simulations demonstrate that DLS outperforms ordinary least square for certain types of deconvolution problems.

• Structural Engineering and Mechanics
• /
• v.34 no.6
• /
• pp.739-753
• /
• 2010

Pointing to the design requirement of prestressed space grid structure being the target cable force, the pretension scheme decision analysis method is studied when there's great difference between structural actual state and the analytical model. Based on recursive formulation of cable forces, the simulative recursive system for pretension process is established from the systematic viewpoint, including four kinds of parameters, i.e., system initial value (structural initial state), system input value (tensioning control force scheme), system state parameters (influence matrix of cable forces), system output value (pretension accomplishment). The system controllability depends on the system state parameters. Based on cable force observation values, the influence matrix for system state parameters can be calculated, making the system controllable. Next, the pretension scheme decision method based on cable force observation values can be formed on the basis of iterative calculation for recursive system. In this way, the tensioning control force scheme that can meet the design requirement when next cyclic supplemental tension finished is obtained. Engineering example analysis results show that the proposed method in this paper can reduce a lot of cyclic tensioning work and meanwhile the design requirement can be met.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.446-450
• /
• 1987

In this paper, overdetermined method is used for high resolution spectral estimation in case of short data record length. To reduce the computational effort and to obtain recursive form of estimation algorithm, we modify data matrix to have near-Toeplitz structure. Then, new recursive algorithm is derived in the form of fast Kalman algorithm. Two stage procedure is used for the estimation of ARMA parameters. First AR parameters are estimated by using overdetermined modified Yule-walker equation, and then MA parameters are implicitly estimated by estimating numerator spectral coefficients(NS).

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.525-525
• /
• 2000

In this paper, we present recursive algorithms for state space model identification using subspace extraction via Schur complement. It is shown that an estimate of the extended observability matrix can be obtained by subspace extraction via Schur complement. A relationship between the least squares residual and the Schur complement matrix obtained from input-output data is shown, and the recursive algorithms for the subspace-based state-space model identification (4SID) methods are developed. We also proposed the above algorithm for an instrumental variable (IV) based 4SID method. Finally, a numerical example of the application of the algorithms is illustrated.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.167.5-167
• /
• 2001

Single point attitude determination method provides an optimal attitude minimizing the Wahba loss function. However, for the insufficient number of measurement vectors, the conventional single point methods has no unique solution. Thus, we introduce the sequential method to and an optimal attitude minimizing the windowed loss function. In this paper, this function is de ned as the sum of square errors for all measurement vectors within the axed sliding window. For simple implementation, the proposed algorithm is rewritten as a recursive form. Moreover, the covariance matrix is derived and expressed as a recursive form. Finally, we apply this algorithm to the attitude determination system with three LOS measurement sensors.