The procedure of updating an existing but inaccurate model is an essential step toward establishing an effective model. Updating damping and stiffness matrices simultaneously with measured modal data can be mathematically formulated as following two problems. Problem 1: Let Ma∈SRn×n be the analytical mass matrix, and Λ=diag{λ1,…,λp}∈Cp×p, X=[x1,…,xp]∈Cn×p be the measured eigenvalue and eigenvector matrices, where rank(X)=p, p<n and both Λ and X are closed under complex conjugation in the sense that \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\lambda_{2j} = \bar{\lambda}_{2j-1} \in\nobreak{\mathbf{C}} $\end{document}, \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$x_{2j} = \bar{x}_{2j-1} \in{\mathbf{C}}^{n} $\end{document} for j=1,…,l, and λk∈R, xk∈Rn for k=2l+1,…,p. Find real-valued symmetric matrices D and K such that MaXΛ2+DXΛ+KX=0. Problem 2: Let Da,Ka∈SRn×n be the analytical damping and stiffness matrices. Find \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$(\hat{D}, \hat{K}) \in\mathbf{S}_{\mathbf{E}}$\end{document} such that \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$\| \hat{D}-D_{a} \|^{2}+\| \hat{K}-K_{a} \|^{2}= \min_{(D,K) \in \mathbf{S}_{\mathbf{E}}}(\| D-D_{a} \|^{2} +\|K-K_{a} \|^{2})$\end{document}, where SE is the solution set of Problem 1 and ∥⋅∥ is the Frobenius norm. In this paper, a gradient based iterative (GI) algorithm is constructed to solve Problems 1 and 2. A sufficient condition for the convergence of the iterative method is derived and the range of the convergence factor is given to guarantee that the iterative solutions consistently converge to the unique minimum Frobenius norm symmetric solution of Problem 2 when a suitable initial symmetric matrix pair is chosen. The algorithm proposed requires less storage capacity than the existing numerical ones and is numerically reliable as only matrix manipulation is required. Two numerical examples show that the introduced iterative algorithm is quite efficient.
