• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.211-222
• /
• 2017

In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

• Structural Engineering and Mechanics
• /
• v.88 no.5
• /
• pp.493-500
• /
• 2023

The multiparameter eigenvalue method can be used to solve the damped finite element model updating problems. This method transforms the original problems into multiparameter eigenvalue problems. Comparing with the numerical methods based on various optimization methods, a big advantage of this method is that it can provide all possible choices of physical parameters. However, when solving the transformed singular multiparameter eigenvalue problem, the proposed method based on the generalised inverse of a singular matrix has some computational challenges and may fail. In this paper, more details on the transformation from the dynamic model updating problem to the multiparameter eigenvalue problem are presented and the structure of the transformed problem is also exposed. Based on this structure, the rigorous mathematical deduction gives the upper bound of the number of possible choices of the physical parameters, which confirms the singularity of the transformed multiparameter eigenvalue problem. More importantly, we present a row and column compression method to overcome the defect of the proposed numerical method based on the generalised inverse of a singular matrix. Also, two numerical experiments are presented to validate the feasibility and effectiveness of our method.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.87-98
• /
• 2006

In this paper, a class of constrained inverse eigenvalue problem for antisymmetric matrices and their optimal approximation problem are considered. Some sufficient and necessary conditions of the solvability for the inverse eigenvalue problem are given. A general representation of the solution is presented for a solvable case. Furthermore, an expression of the solution for the optimal approximation problem is given.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.455-459
• /
• 1986

A large set of linear equations which arise in many applications, such as in digital signal processing, image filtering, estimation theory, numerical analysis, etc. involve the problem of a tridiagonal matrix. In this paper, the determinant, eigenvalue and inverse matrix of a tridiagoanl matrix are analytically evaluated.

• Korean Journal of Mathematics
• /
• v.23 no.2
• /
• pp.259-267
• /
• 2015

This paper is devoted to investigate the existence of the solutions for a class of the noncooperative elliptic system involving critical Sobolev exponents. We show the existence of the negative solution for the problem. We show the existence of the unique negative solution for the system of the linear part of the problem under some conditions, which is also the negative solution of the nonlinear problem. We also consider the eigenvalue problem of the matrix.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.11
• /
• pp.901-906
• /
• 2005

The stability robustness problem of continuous linear systems with nominal and delayed time-varying perturbations is considered. In the previous results, the entire bound was derived only for the overall perturbations without separation of the perturbations. In this paper, the sufficient condition for stability of the system with two perturbations, which are nominal and delayed, is expressed as linear matrix inequalities(LMIs). The corresponding stability bounds fer those two perturbations are determined by LMI(Linear Matrix Inequality)-based generalized eigenvalue problem. Numerical examples are given to compare with the previous results and show the effectiveness of the proposed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.05a
• /
• pp.117-119
• /
• 2005

For large structural eigen-analysis, the whole structure is divided into some partitioned structures and through synthesis of partitioned structural model the eigen-data of structure can be obtained. In that case, eigenvalue problem consists of semidefinite mass matrix form because of displacement constraint condition. In this work the eigenvalue problem is considered by means of several method, determinant search and null space reduction method.

• 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.

• Proceedings of the KIEE Conference
• /
• 2001.07a
• /
• pp.217-219
• /
• 2001

This paper presents a new eigenvalue sensitivity analysis method based on AESOPS algorithm. The additional calculation steps are derived from the original AESOPS algorithm. The additional calculation steps are performed directly from the AESOPS algorithm after iteratively calculating electro-mechanical oscillation modes in small signal stability problems. Owing to the structural characteristics of partitioned sub-matrix of state space equations, the partial differentiation terms of system state matrix for obtaining eigenvalue sensitivity indices can be calculated very simply. By the method presented in this paper, the AESOPS algorithm can be used in controller design problem as well as analysis of small signal stability problem.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.99-110
• /
• 2000

This paper is devoted to the parallelism of a numerical matrix eigenvalue problem. The eigenproblem arises in a variety of applications, including engineering, statistics, and economics. Especially we try to approach the industrial techniques from mathematical modeling. This paper has developed a parallel algorithm to find all eigenvalues. It is contributed to solve a specific practical problem, a vibration problem in the industry. Also we compare the runtime between the serial algorithm and the parallel algorithm for the given problems.