Research Article  Open Access
An Inverse Eigenvalue Problem for Damped Gyroscopic SecondOrder Systems
Abstract
The inverse eigenvalue problem of constructing symmetric positive semidefinite matrix (written as ) and realvalued skewsymmetric matrix (i.e., ) of order for the quadratic pencil , where , are given analytical mass and stiffness matrices, so that has a prescribed subset of eigenvalues and eigenvectors, is considered. Necessary and sufficient conditions under which this quadratic inverse eigenvalue problem is solvable are specified.
1. Introduction
Vibrating structures such as beams, buildings, bridges, highways, and large space structures, are distributed parameter systems. While it is desirable to obtain a solution of a vibration problem in its own natural setting of distributed parameter systems; due to the lack of appropriate computational methods, in practice, very often a distributed parameter system is first discretized to a matrix secondorder model (referred to as an analytical model) using techniques of finite elements or finite differences and then an approximate solution is obtained from the solution of the problem in the analytical model. A matrix secondorder model of the free motion of a vibrating system is a system of differential equations of the form
where , and are, respectively, analytical mass, damping, gyroscopic and stiffness matrices.
The system represented by (1.1) is called damped gyroscopic system. The gyroscopic matrix is always skew symmetric and, in general, the mass matrix is symmetric and positive definite and are symmetric positive semidefinite; the system is called symmetric definite system. If the gyroscopic force is not present, then the system is called nongyroscopic.
It is well known that all solutions of the differential equation of (1.1) can be obtained via the algebraic equation
Complex numbers and nonzero vectors for which this relation holds are, respectively, the eigenvalues and eigenvectors of the system. The “forward” problem is, of course, to find the eigenvalues and eigenvectors when the coefficient matrices are given. Many authors have devoted to this kind of problem and a series of good results have been made (see, e.g., [1–7]). Generally speaking, very often natural frequencies and mode shapes (eigenvalues and eigenvectors) of an analytical model described by (1.2) do not match very well with experimentally measured frequencies and mode shapes obtained from a reallife vibrating structure. Thus, a vibration engineer needs to update the theoretical analytical model to ensure its validity for future use. In view of in analytical model (1.1) for structure dynamics, the mass and stiffness are, in general, clearly defined by physical parameters. However, the effect of damping and Coriolis forces on structural dynamic systems is not well understood because it is purely dynamics property that cannot be measured statically. Our main interest in this paper is the corresponding inverse problem, given partially measured information about eigenvalues and eigenvectors, we reconstruct the damping and gyroscopic matrices to produce an adjusted analytical model with modal properties that closely match the experimental modal data. Recently, the quadratic inverse eigenvalue problems over the complex field have been well studied and there now exists a wealth of information. Many papers have been written (see, e.g., [8–15]), and a complete book [16] has been devoted to the subject. In the present paper we will consider an inverse problem related to damped gyroscopic secondorder systems.
Problem P
Given a pair of matrices in the form
where and are closed under complex conjugation in the sense that for and for we find symmetric positive semidefinite matrix and realvalued skewsymmetric matrix that satisfy the following equation:
In other words, each pair is an eigenpair of the quadratic pencil
where and are given analytical mass and stiffness matrices.
The goal of this paper is to derive the necessary and sufficient conditions on the spectral information under which the inverse problem is solvable. Our proof is constructive. As a byproduct, numerical algorithm can also be developed thence. A numerical example will be discussed in Section 3.
In this paper we will adopt the following notation. denote the set of all complex and real matrices, respectively. denotes the set of all orthogonal matrices in . Capital letters denote matrices, lower case letters denote column vectors, Greek letters denote scalars, denotes the conjugate of the complex number , denotes the transpose of the matrix , denotes the identity matrix, and denotes the MoorePenrose generalized inverse of . We write if is real symmetric positive definite (positive semidefinite).
2. Solvability Conditions for Problem P
Let (the real part of the complex number ), (the imaginary part of the complex number ), , for . Define
Then the equation of (1.5) can be written equivalently as
and the relations of and are
In order to solve the equation of (2.4), we shall introduce some lemmas.
Lemma 2.1 (see [17]). If , then has a solution if and only if . In this case, the general solution of the equation can be described as , where is an arbitrary matrix.
Lemma 2.2 (see [18, 19]). Let then has a solution if and only if When condition (2.7) is satisfied, a particular solution of (2.6) is and the general solution of (2.6) can be expressed as where is an arbitrary matrix.
Lemma 2.3 (see [20]). Let be a real symmetric matrix partitioned into blocks, where and are square submatrices. Then is a symmetric positive semidefinite matrix if and only if Lemma 2.3 directly results in the following lemma.
Lemma 2.4. Let be a real symmetric matrix partitioned into blocks, where is the known symmetric submatrix, and are two unknown submatrices. Then there exist matrices such that is a symmetric positive semidefinite matrix if and only if . Furthermore, all submatrices can be expressed as where is an arbitrary matrix and is an arbitrary symmetric positive semidefinite matrix.
By Lemma 2.1, the equation of (2.4) with respect to unknown matrix has a solution if and only if
In this case, the general solution of (2.4) can be written as
where is an arbitrary matrix and
For a fixed symmetric positive semidefinite matrix , we know, from the lemma (2.2), that the equation of (2.15) has a solution if and only if
Let the singular value decomposition (SVD) of be
where , and define
Then (2.16) becomes
Clearly, if and only if
or equivalently,
According to Lemma 2.4, we know if condition (2.21) holds, then there are a family of symmetric positive semidefinite matrices
where is an arbitrary matrix, and is an arbitrary symmetric positive semidefinite matrix, satisfying the equation of (2.16).
Applying Lemma 2.2 again to the equation of (2.15) yields
where
is a particular solution of (2.15) with the same as in (2.22), and is an arbitrary matrix.
Since , it follows from (2.13) and (2.23) that
where
and is an arbitrary skewsymmetric matrix.
By now, we have proved the following result.
Theorem 2.5. Let , and let the matrix pair be given as in (1.3) and (1.4). Separate matrices and into real parts and imaginary parts resulting and expressed as in (2.1) and (2.2). Let the SVD of be (2.17). Then Problem P is solvable if and only if conditions (2.12) and (2.21) are satisfied, in which case, and are given, respectively, by (2.22) and (2.25).
Note that when rank, that is, is full row rank, then the arbitrary matrices and in the equation of (2.22) disappear, in this case, is uniquely determined, and so is . Thus, we have the following corollary.
Corollary 2.6. Under the same assumptions as in Theorem 2.5, suppose that rank , if condition (2.12) and are satisfied. Then there exist unique matrices and such that (1.5) holds. Furthermore, and can be expressed as
3. A Numerical Example
Based on Theorem 2.5 we can state the following algorithm.
Algorithm 3.1. An algorithm for solving Problem P.(1)Input (2)Separate matrices and into real parts and imaginary parts resulting and given as in (2.1) and (2.2).(3)Compute the SVD of according to (2.17).(4)If (2.12) and (2.21) hold, then continue, otherwise, go to (1).(5)Choose matrices , with , and with .(6)According to (2.22) and (2.25) calculate and .
Example 3.2. Consider a fiveDOF system modelled analytically with mass and stiffness matrices given by The measured eigenvalue and eigenvector matrices and are given by According to Algorithm 3.1, it is calculated that conditions (2.12) and (2.21) hold. Thus, by choosing we can figure out We define the residual as where is the Frobenius norm, and the numerical results shown in Table 1.

References
 F. Tisseur and K. Meerbergen, “The quadratic eigenvalue problem,” SIAM Review, vol. 43, no. 2, pp. 235–286, 2001. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 Z. C. Zheng, G. X. Ren, and W. J. Wang, “A reduction method for large scale unsymmetric eigenvalue problems in structural dynamics,” Journal of Sound and Vibration, vol. 199, no. 2, pp. 253–268, 1997. View at: Publisher Site  Google Scholar  MathSciNet
 L. Meirovitch, “A new method of solution of the eigenvalue problem for gyroscopic systems,” AIAA Journal, vol. 12, pp. 1337–1342, 1974. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 W. Kliem and C. Pommer, “On the stability of linear nonconservative systems,” Quarterly of Applied Mathematics, vol. 43, no. 4, pp. 457–461, 1986. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 J.S. Guo, W.W. Lin, and C.S. Wang, “Numerical solutions for large sparse quadratic eigenvalue problems,” Linear Algebra and Its Applications, vol. 225, pp. 57–89, 1995. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 T.M. Hwang, W.W. Lin, and V. Mehrmann, “Numerical solution of quadratic eigenvalue problems with structurepreserving methods,” The SIAM Journal on Scientific Computing, vol. 24, no. 4, pp. 1283–1302, 2003. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. T. Chu, T.M. Hwang, and W.W. Lin, “A novel deflation technique for solving quadratic eigenvalue problems,” NCTS TechReport, National Tsing Hua University, Hsinchu, Taiwan, 2005. View at: Google Scholar
 M. T. Chu, B. N. Datta, W. W. Lin, and S.F. Xu, “Spillover phenomenon in quadratic model updating,” AIAA Journal, vol. 46, pp. 420–428, 2008. View at: Publisher Site  Google Scholar
 M. T. Chu, W.W. Lin, and S.F. Xu, “Updating quadratic models with no spillover effect on unmeasured spectral data,” Inverse Problems, vol. 23, no. 1, pp. 243–256, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 J. B. Carvalho, B. N. Datta, W.W. Lin, and C.S. Wang, “Symmetry preserving eigenvalue embedding in finiteelement model updating of vibrating structures,” Journal of Sound and Vibration, vol. 290, no. 3–5, pp. 839–864, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 B. N. Datta, S. Elhay, and Y. M. Ram, “Orthogonality and partial pole assignment for the symmetric definite quadratic pencil,” Linear Algebra and Its Applications, vol. 257, pp. 29–48, 1997. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. I. Friswell, D. J. Inman, and D. F. Pilkey, “Direct updating of damping and stiffness matrices,” AIAA Journal, vol. 36, no. 3, pp. 491–493, 1998. View at: Publisher Site  Google Scholar
 Y.C. Kuo, W.W. Lin, and S.F. Xu, “New methods for finite element model updating problems,” AIAA Journal, vol. 44, no. 6, pp. 1310–1316, 2006. View at: Publisher Site  Google Scholar
 Y.C. Kuo, W.W. Lin, and S.F. Xu, “Solutions of the partially described inverse quadratic eigenvalue problem,” SIAM Journal on Matrix Analysis and Applications, vol. 29, no. 1, pp. 33–53, 2006. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 W.W. Lin and J.N. Wang, “Partial pole assignment for the quadratic pencil by output feedback control with feedback designs,” Numerical Linear Algebra with Applications, vol. 12, no. 10, pp. 967–979, 2005. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. T. Chu and G. H. Golub, Inverse Eigenvalue Problems: Theory, Algorithms, and Applications, Oxford University Press, Oxford, UK, 2005. View at: MathSciNet
 A. BenIsrael and T. N. E. Greville, Generalized Inverses: Theory and Applications, Wiley, New York, NY, USA, 1974. View at: MathSciNet
 H. W. Braden, “The equations ${A}^{T}X\pm {X}^{T}A=B$,” SIAM Journal on Matrix Analysis and Applications, vol. 20, no. 2, pp. 295–302, 1999. View at: Publisher Site  Google Scholar  MathSciNet
 Y. X. Yuan, “Symmetric solutions of a class of linear matrix equations,” Journal of Engineering Mathematics, vol. 15, no. 3, pp. 25–29, 1998 (Chinese). View at: Google Scholar  Zentralblatt MATH  MathSciNet
 A. Albert, “Conditions for positive and nonnegative definiteness in terms of pseudoinverses,” SIAM Journal on Applied Mathematics, vol. 17, pp. 434–440, 1969. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
Copyright
Copyright © 2009 Yongxin Yuan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.