当前位置: X-MOL 学术Linear Multilinear Algebra › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A direct method for updating mass and stiffness matrices with submatrix constraints
Linear and Multilinear Algebra ( IF 0.9 ) Pub Date : 2021-01-22 , DOI: 10.1080/03081087.2021.1874263
Jiao Xu 1 , Yongxin Yuan 1
Affiliation  

The finite element model errors mainly come from the complex parts of the geometry, boundary conditions and stress state of the structure. Therefore, the problem for updating mass and stiffness matrices can be reduced to an inverse problem for symmetric matrices with submatrix constraints (IP-MUP): Let Λ = d i a g ( λ 1 , , λ p ) R p × p and Φ = [ ϕ 1 , , ϕ p ] R n × p be the measured eigenvalue and eigenvector matrices with r a n k ( Φ ) = p . Find n × n symmetric matrices M and K such that K Φ = M Φ Λ , Φ M Φ = I p ,   s . t .   M ( r ) = M 0 , K ( r ) = K 0 , where M ( r ) and K ( r ) are the r × r leading principal submatrices of M and K, respectively. We then consider an optimal approximation problem (OAP): Given n × n symmetric matrices M a and K a . Find ( M ˆ , K ˆ ) S E such that K ˆ K a 2 + M ˆ M a 2 = min ( M , K ) S E ( K K a 2 + M M a 2 ) , where S E is the solution set of Problem IP-MUP. In this paper, the solvability condition for Problem IP-MUP is established, and the expression of the general solution of Problem IP-MUP is derived. Also, we show that the optimal approximation solution ( M ˆ , K ˆ ) is unique and derive an explicit formula for it.



中文翻译:

用子矩阵约束更新质量和刚度矩阵的直接方法

有限元模型误差主要来自几何结构的复杂部分,边界条件和结构的应力状态。因此,对于具有子矩阵约束的对称矩阵(IP-MUP),可以将更新质量和刚度矩阵的问题简化为一个反问题: Λ = d 一世 一种 G λ 1个 λ p [R p × p Φ = [ ϕ 1个 ϕ p ] [R ñ × p 是测量的特征值和特征向量矩阵 [R 一种 ñ ķ Φ = p 。找 ñ × ñ 对称矩阵中号ķ使得 ķ Φ = 中号 Φ Λ Φ 中号 Φ = 一世 p   s Ť   中号 [R = 中号 0 ķ [R = ķ 0 哪里 中号 [R ķ [R [R × [R MK的前导主要子矩阵。然后,我们考虑最佳逼近问题(OAP): ñ × ñ 对称矩阵 中号 一种 ķ 一种 。找 中号 ˆ ķ ˆ 小号 Ë 这样 ķ ˆ - ķ 一种 2 + 中号 ˆ - 中号 一种 2 = 中号 ķ 小号 Ë ķ - ķ 一种 2 + 中号 - 中号 一种 2 ,在哪里 小号 Ë 是问题IP-MUP的解决方案集。本文建立了问题IP-MUP的可解性条件,并推导了问题IP-MUP的一般解的表示。此外,我们证明了最佳逼近解 中号 ˆ ķ ˆ 是唯一的,并为此导出一个明确的公式。

更新日期:2021-01-24
down
wechat
bug