• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.226-231
• /
• 2008

In this paper, we propose novel eigenstructure assignment method in full-state feedback for linear time-invariant MIMO system such that directions of some left eigenvectors are exactly assigned to the desired directions. It is required to consider the direction of left eigenvector in designing eigenstructure of closed-loop system, because the direction of left eigenvector has influence over excitation by associated input variables in time-domain response. Exact direction of a left eigenvector can be achieved by assigning proper right eigenvector set satisfying the conditions of the presented theorem based on Moore's theorem and the orthogonality of left and right eigenvector. The right eigenvector should reside in the subspace given by the desired eigenvalue, which restrict a number of designable left eigenvector. For the two cases in which desired eigenvalues are all real and contain complex number, design freedom of designable left eigenvector are given.

• Journal of the Korean Statistical Society
• /
• v.24 no.1
• /
• pp.183-195
• /
• 1995

For a distribution on the unit sphere, the set of eigenvectors of the second moment matrix is a conventional measure of orientation. Asymptotic confidence cones for eigenvector under the parametric assumptions for the underlying distributions and nonparametric confidence cones for eigenvector based on bootstrapping were proposed. In this paper, to reduce the level error of confidence cones for eigenvector, double bootstrap confidence cones based on prepivoting are considered, and the consistency of this method is discussed. We compare the perfomances of double bootstrap method with the others by Monte Carlo simulations.

• Journal of Korean Society of Steel Construction
• /
• v.8 no.3 s.28
• /
• pp.21-34
• /
• 1996

A numerical method is presented for computation of eigenvector derivatives used an iterative procedure with guaranteed convergence. An approach for treating the singularity in calculating the eigenvector derivatives is presented, in which a shift in each eigenvalue is introduced to avoid the singularity. If the shift is selected properly, the proposed method can give very satisfactory results after only one iteration. A criterion for choosing an adequate shift, dependent on computer hardware is suggested ; it is directly dependent on the eigenvalue magnitudes and the number of bits per numeral of the computer. Another merit of this method is that eigenvector derivatives with repeated eigenvalues can be easily obtained if the new eigenvectors are calculated. These new eigenvectors lie "adjacent" to the m (number of repeated eigenvalues) distinct eigenvectors, which appear when the design parameter varies. As an example to demonstrate the efficiency of the proposed method in the case of distinct eigenvalues, a cantilever plate is considered. The results are compared with those of Nelson's method which can find the exact eigenvector derivatives. For the case of repeated eigenvalues, a cantilever beam is considered. The results are compared with those of Dailey's method which also can find the exact eigenvector derivatives. The design parameter of the cantilever plate is its thickness, and that of the cantilever beam its height.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.4
• /
• pp.282-287
• /
• 2004

This paper proposes the nearfield eigenvector method for array shape estimation using reference signals basted on the nearfield signal modeling. Generally. direction finding methods assume the reference signals to be plainwave. However, in case of the reference signals in nearfield, this assumption is inadequate for array shape estimation. In this paper. the nearfield reference signals are modeled. and we propose the nearfield eigenvector method. The numerical experiments indicated that the proposed method shows good performance for array shape estimation regardless of the ranges of the reference signals.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.115-120
• /
• 2000

This paper examines that it is possible to apply RWCIM for determining eigenvector coefficients associated with eigenvalues for V-notched cracks in anisotropic dissimilar materials using the complex stress function. To verify the RWCIM algorithm, two tests will be shown. First it is performed to ascertain whether predicted coefficients associated with eigenvectors is obtained exactly. Second, it makes an examination of the state of stress for FEM and RWCIM according to a number of eigenvectors at a location far away from the V-notched crack tip.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.9
• /
• pp.1368-1375
• /
• 2001

This paper examines that it is possible to apply RWCIM for determining eigenvector coefficients associated with eigenvalues for V-notched cracks in anisotropic dissimilar materials using the complex stress function. To verify the RWCIM algorithm, two tests will be shown. First, it is performed to ascertain whether predicted coefficients associated with eigenvectors are obtained exactly. Second, it makes an examination of the state of stresses for FEM and RWCIM according to a number of eigenvectors at a location far away from the v-notched crack tip.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.12
• /
• pp.88-94
• /
• 2001

The V-notched crack problem in dissimilar materials can be formulated as an eigenvalue problem. The RWCIM(Reciprocal Work Contour Integral Method) is applied to the determination of the eigenvector coefficients associated with eigenvalues for V-notched cracks in pseudo-isotropic and anisotropic dissimilar materials. The RWCIM algorithm is programed by the commercial numerical program, MATHEMATICA. The numerical results obtained are shown that the RWCIM is a useful method for determining the eigenvector coefficients of V-notched cracks in pseudo-isotropic and anisotropic dissimilar materials.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.411-419
• /
• 1999

In this paper, we propose an evaluation model of systems level using modified eigenvector method and fuzzy subordination relations. This model is desibmed to evaluate the level of system in enterprise. In here. modified eigenvector method is proposed to compute the weights of each criteria in two evaluation group. Also, fuzzy subordination relations is used to evaluate the relationship between the criteria by painvise comparison. In this paper. we can get the evaluated score for the present level of system. This method will help to manage and improve the systems. We show the efficiency of the this method by means of a case study for evaluation problem of environmental management systems.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.8
• /
• pp.958-964
• /
• 1999

The distance in load parameter space to the closest saddle node bifurcation (CSNB) point provides the worst case power margin to voltage instability and the left eigenvector at CSNB identifies the most effective direction to steer the system to maximize voltage stability under contingency. This paper presents an improved direct method for computing CSNB: the order of nonlinear systems equations is reduced to about twice of the size of load flow equations in contrast to about three-times in Dobson's direct method; the initial guess for the direct method is computed efficiently and robustly by combined use of continuation power flow, a pair of multiple load flow solution with Lagrange interpolation. It is also shown that voltage stability may be enhanced significantly with shift of generations in the direction of the left eigenvector at CSNB.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.25-31
• /
• 2016

There are many methods to describe the importance of a node, centrality, in a graph. In this paper, we focus on the eigenvector centrality. In this paper, an analytical method to estimate the difference of centrality with an additional edge in a graph is proposed. In order to validate the analytical method to estimate the centrality, two problems, to decide an additional edge that maximizes the difference of all centralities of all nodes in the graph and to decide an additional edge that maximizes the centrality of a specific node, are solved using three kinds of random graphs and the results of the estimated edge and observed edge are compared. Though the estimated centrality difference is slightly different from the observed real centrality in some cases, it is shown that the proposed method is effective to estimate the centrality difference with a short running time.