• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.243-248
• /
• 1997

A full multigrid scheme was used in computing some eigenvalues of the Laplace eigenvalues problem with the Dirichlet bound-ary condition. We get a system of algebraic equations with an aid of finite difference method and apply subspace iteration method to the system to compute first some eigenvalues. The result shows that this is very effective in calculating some eigenvalues of this problem.

• Journal of the Chungcheong Mathematical Society
• /
• v.2 no.1
• /
• pp.81-90
• /
• 1989

Let $D:C^n(I){\longrightarrow}M$ be a derivation from the Banach algebra of n times continuously differentiable functions on an interval I into a Banach $C^n(I)$-module M. If D is continuous and D(z) is contained in the k-differential subspace, the image of D is contained in the k-differential subspace. The question of when the image of a derivation is contained in the k-differential subspace is discussed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.784-787
• /
• 2004

Modified version of subspace iteration method using accelerated starting vectors is proposed to efficiently calculate free vibration modes of structures. Proposed method employs accelerated Lanczos starting vectors that can reduce the number of iterations in the subspace iteration method. Proposed method is more efficient than the conventional method when the number of required modes is relatively small. To verify the efficiency of proposed method, two numerical examples are presented.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.79-80
• /
• 2006

In this paper, we compare two different anti-jamming schemes, Subspace projection and SCORE algorithm. For multipath cancelation, nulling technique is applied to both anti-jamming schemes. It is noted that SCORE algorithm is more robust to the multipath interference. It is also noted that Subspace projection scheme requires nulling technique for multipath mitigation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.10a
• /
• pp.503-508
• /
• 2003

This paper proposes modified subspace iteration method for efficient frequency analysis of structures. Proposed method uses accelerated Lanczos vectors as starting vectors in order to reduce the number of iterations in the subspace iteration method. Proposed method has better computing efficiency than the conventional method when the number of desired frequencies is relatively small. The efficiency of proposed method is verified through numerical examples.

• Journal of Korean Association for Spatial Structures
• /
• v.3 no.4 s.10
• /
• pp.53-58
• /
• 2003

In order to control seismic responses of building structures effectively and stably, it is very important to estimate the dynamic characteristics of target structure exactly based on input-output signal data. In this paper, it is shown that Subspace Identification Method is able to be applied effectively to system identification of building structures. To verify the efficiency of Subspace Identification Method, the vibration experiments were conducted on a specimen structure which is a 5-storied building structure model consisted of H-shaped steel beam, and the simulated seismic responses of the identified structure model were compared with the observed ones under the same excitation. It was observed that the experimental results coincided with the analyzed ones proposed in this paper.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1852-1861
• /
• 1997

An enhanced subspace iteration algorithm has been developed to solve eigenvalue problems reliably and efficiently. Basic subspace iteration algorithm has been improved by eliminating recalculation of converged eigenvectors, using Krylov sequence as initial vectors and incorporating with shifting techniques. The number of iterations and computational time have been considerably reduced when compared with the original one, and reliability for catching copies of the multiple roots has been retained successfully. Further research would be required for mathematical justification of the present method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.9
• /
• pp.32-39
• /
• 2006

In this paper, an iterative subspace-based calibration algorithm for a CDMA-based antenna array in the presence of unknown gain and phase error is presented. The algorithm does not depend on the array geometry and does not require a prior knowledge of the Directions Of Arrival (DOA) of the signals. The method requires the code sequence of a reference user only. The proposed algorithm is based on the subspace method and root finding approach, and it provides estimates of the calibration vector, the DOA and the channel impulse response, by using the code sequence of a reference user. The performance of the proposed algorithm was investigated by means of computer simulations and was verified using field data measured through a custom-built W-CDMA test-bed. The data show that experimental results match well with the theoretical calibration algorithm. Also, teh study propose an efficient algorithm using the simulated annealing technique. This algorithm overcomes the requirement of initial guessing in the subspace-based approach.

• Journal of Industrial Technology
• /
• v.31 no.B
• /
• pp.3-7
• /
• 2011

This paper addresses a computationally simple adaptive beamforming method to cancel interferences arriving onto a sensor array. In the proposed method, an estimate of the interference subspace is extracted from a submatrix of the sample covariance matrix and an orthonormal basis for the estimated subspace is efficiently found, one basis vector being updated every sample. Its computational burden is just $O(M{\eta})$ in an M-sensor array when ${\eta}$ directional signals are present. The new method does not make any premises of the geometrical structure of arrays, and can be applied to arbitrary arrays.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.1
• /
• pp.65-70
• /
• 1997

An active sonar is used to the navigation system or military purposes. In the active sonar one of the problems is a reverberation. The reflected signals from surface, bottom, and volume are received at receiver. This reverberation is an interference in the active sonar, and for the enhanced performance must be rejected. In this paper I study the method to reject the reverberation. The proposed method use the orthogonal property between the signal subspace and noise subspace in the eigen subspace. In the proposed method the noise subspace is calculated. I have performed the computer simulations to prove the performance of the proposed method.