| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4641414 | Journal of Computational and Applied Mathematics | 2009 | 8 Pages |
Abstract
This paper is concerned with the problem of the best approximation for a given matrix pencil under a given spectral constraint and a submatrix pencil constraint. Such a problem arises in structural dynamic model updating. By using the Moore–Penrose generalized inverse and the singular value decomposition (SVD) matrices, the solvability condition and the expression for the solution of the problem are presented. A numerical algorithm for solving the problem is developed.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yong-Xin Yuan, Hua Dai,