A New Updating Method for the Undamped Vibroacoustic System with No Spill-Over

Abstract

In this paper, we consider the model updating problem of the undamped vibroacoustic system with no spill-over (MUP-UVA), which is to update the original system to a new system such that some “unstable” eigenvalues are replaced by some newly measured ones. Based on the spectral decomposition of the undamped vibroacoustic system, a necessary and sufficient condition is derived such that the updated system can preserve no spill-over, and a set of parametric solutions of MUP-UVA is characterized. Furthermore, a gradient optimization algorithm for the minimum norm solution of MUP-UVA is proposed and the performance of the algorithm is illustrated by several numerical experiments.

Share and Cite:

Zhou, X. and Zhao, K. (2025) A New Updating Method for the Undamped Vibroacoustic System with No Spill-Over. Journal of Applied Mathematics and Physics, 13, 2876-2891. doi: 10.4236/jamp.2025.139164.

1. Introduction

It is well known that the Finite Element Model (FEM) can be used to predict the dynamic characteristics of the engineering structures. In practice, the structural dynamic mathematical models are usually very large and sparse, and only a small number of natural frequencies (eigenvalues) and model shapes (eigenvectors) can be experimentally measured from a realized actual structure. Comparing with the corresponding ones from the FEM of these structures, there may be inconsistencies between these two sets of eigenpairs, i.e., the FEM may be inaccurate. Therefore, the existing FEM should be updated with minimal changes, so that the updated model can accurately predict the dynamic characteristics of the structure. On the other hand, the method of Model Updating (MUP) can also be used to eliminate resonance. As is known, if frequencies of the system excited are the same as or close to the natural frequencies of a certain order, the vibrations of the system may be significantly amplified and resonance occurs, which may cause very large damage. Passive control [1] and active control [2] are two classical methods to deal with resonance problems. Active control relies on feedback control through actuators and sensors, while passive control, which is also known as model updating, updates the physical parameters of the original system so that some “unstable” natural frequencies are replaced by newly measured or expected ones. For large structures, there are usually only a few natural frequencies that need to be reassigned, due to the limited number and frequency range of measured coordinates. In order to ensure the stability of the structure, the remaining unmeasured natural frequencies and model shapes should be kept unchanged. In other words, it is required to keep the unchanged eigenvalues and their related eigenvectors unaffected by model updating when the system is adjusted and modified, which is called no spill-over property.

In the past decades, various techniques for MUP by the measured eigendata have been discussed, for example, Friswell [3] [4], Kuo [5] [6], Chu [7] , and Moreno [9]. The main purpose of MUP is to characterize the coefficient matrices of FEM by some prescribed eigenpairs, and its main challenge is how to preserve the no spill-over property and the structures of system matrices (such as symmetry, positive definiteness and sparsity, and so on) simultaneously. Chu et al. [10] investigated the spill-over phenomenon in the MUP. They showed that the MUP with no spill-over is possible in undamped models. Mao [11] considered the MUP with no spill-over where the mass matrix and stiffness matrices are updated simultaneously, and the matrices preserve positive definiteness. For the damped vibration system, Chu provided some sufficient and necessary conditions that the MUP with no spill-over is solvable with mass and stiffness matrices being positive definite. With the spectral decomposition of some matrix polynomials, the solutions of the MUP with no spill-over were characterized for the undamped piezoelectric smart structure system [12] and the -palindromic quadratic system [13]. Recently, analytical expressions of structure preserving no spill-over updating were determined for some specific structured matrix pencils, including symmetric, Hermitian, -even and -odd [14]. They first consider a quadratic inverse eigenvalues problem where the no spill-over property and the -symmetric structures of coefficient matrices are preserved, simultaneously. Therefore, MUP with no spill-over of some structured vibration systems remains a fundamental challenge in the field.

By the finite element technique, the motion for the structure interacting with the enclosed acoustic medium of the undamped vibroacoustic systems can be expressed as the following differential equation [15]

M v ¨ ( t )+Kv( t )=f( t ), (1)

where

M=[ M A C AS 0 M S ],K=[ K A 0 C SA K S ],x( t )=[ x A x S ] (2)

with n= n A + n S , M A , K A n A × n A and M S , K S n S × n S being symmetric, and C AS = C SA T . In (1), the finite elements of the structure and the cavity are coupled together, and their dynamic response affects each other, characterized in the acoustic-structural and structural-acoustic coupling matrices C AS and C SA , M A and M S are referred to as the acoustic and structural mass matrices, while K A and K S are acoustic and structural stiffness matrices. Let v( t )= e ωt x and λ= ω 2 , the vibration of the undamped vibroacoustic model (1) can be characterized by eigenvalues and eigenvectors of the following generalized eigenvalue problem

P( λ )x:=( λM+K )x=0, (3)

As is known, if M is nonsingular, then P( λ ) has n eigenvalues. In this paper, we consider the MUP of the undamped vibroacoustic system with no spill-over, which can be stated as follows:

Problem (MUP-UVA): Given an analytical model ( M,K ) , a set of its eigenpairs { λ i , x i } i=1 p ( 1p<n ) , and a set of measured eigenpairs { μ i , y i } i=1 p , where both λ i and μ i are closed under complex conjugate, find M ˜ A , K ˜ A n A × n A and M ˜ S , K ˜ S n S × n S such that

  • The eigenpairs { λ i , x i } i=1 p of original system are replaced by { μ i , y i } i=1 p in the updated system.

  • The remaining np unknown eigenpairs of the updated system are the same as those of the original system.

  • The acousti–structural coupling matrices C AS and C SA are kept unchanged.

With the assumption that the structural-acoustic coupling matrix being accurately known, Modak [15] provided a direct method of updating an undamped vibroacoustic system, in which the symmetry properties of mass matrices M A , M S and stiffness matrices K A , K S are preserved. However, they didn’t consider the spill-over phenomenon. With the spectral decomposition of a structured quadratic asymmetric pencil, Zhao [16] provided a set of parametric solutions of the MUP with no spill-over for the damped vibroacoustic system. And their method did not need the constraints that the prescribed eigenvectors should span the same subspaces as the original ones. However, these methods cannot be used to solve cases in which the vibroacoustic system has repeated eigenvalues. It is well known that a defective eigenvalue whose geometric multiplicity is less than its algebraic multiplicity, is usually more sensitive to perturbations than a semi-simple eigenvalue. Recently, Guo [17] considered the robust assignment for the repeated poles. Zhao [18] provided a sufficient solvable condition for the MUP with no spill-over for the quadratic asymmetric vibration system. To the best of our knowledge, the MUP with no spill-over for the undamped vibroacoustic system remains open in the following three cases: 1) the system has repeated eigenvalues; 2) the prescribed eigenvectors are chosen arbitrarily; and 3) the sufficient and necessary conditions that the updated system preserves no spill-over.

In this paper, we proposed a new updating method for the undamped vibroacoustic system with no spill-over. The main contributions of this paper are:

1) A sufficient and necessary condition that the updated undamped vibroacoustic system can preserve no spill-over is provided.

2) The parametric solutions of MUP-UVA are characterized by the system matrices and some prescribed eigenpairs without the assumptions that all the eigenvalues of original system and the newly measured eigenvalues are simple.

3) A gradient optimization algorithm for the minimum norm solution of the MUP-UVA is proposed.

2. Sufficient and Necessary Condition for No Spill-Over

Assume that all distinct eigenvalues of P( λ ) are λ 1 , λ ¯ 1 , , λ l , λ ¯ l , λ 2l+1 , , λ k , where λ j = α j +i β j , j=1,,l and λ j , j=2l+1,,k , each of which has algebraic multiplicity n j , i.e., 2 n 1 ++2 n l + n ( 2l+1 ) ++ n k = n A + n S n . Let

X:=[ X 1R , X 1I ,, X lR , X lI , X 2l+1 ,, X k ] n×n , (4)

J:=diag( J R ( λ 1 ),, J R ( λ l ),J( λ ( 2l+1 ) ),,J( λ k ) ) n×n , (5)

where J R ( λ j ) 2 n j ×2 n j and J( λ j ) n j × n j are Jordan canonical forms of λ j for j=1,,l and j=2l+1,,k , respectively, and X is the matrix of right (generalized) eigenvectors corresponding to J . Clearly, ( J,X ) is a Jordan pair [19] of P( λ ) if and only if X is nonsingular and the following matrix equation holds

MXJ+KX=0. (6)

Partition X and J as

X:=[ X 1 , X 2 ],J=diag( Λ 1 , Λ 2 ), (7)

where X 1 n×p , Λ 1 p×p are the representation of the eigenparis { λ j , x j } j=1 p which are to be reassigned. Let ( Σ 1 ,Y ) p×p × n×p be the real representation of the prescribed eigenpairs { μ j , y j } j=1 p .

With the notations above, the MUP-UVA can be mathematically reformulated as follows: given M,K n×n with M,K being nonsingular, Λ 1 , Σ 1 p×p , and X 1 ,Y n×p , find Δ:=diag( Δ M A ,Δ M S ) and ΔK:=diag( Δ K A ,Δ K S ) such that

( M A +Δ M A ) Y A Σ 1 +( K A +Δ K A ) Y A + C AS Y S Σ 1 =0, (8)

( M S +Δ M S ) Y S Σ 1 +( K S +Δ K S ) Y S + C SA Y A =0, (9)

M ˜ X 2 Λ 2 + K ˜ X 2 =0, (10)

where M ˜ =M+Δ , K ˜ =K+ΔK and Y:=[ Y A Y S ] with Y A n A ×p and Y S n S ×p .

From (6), we can see that (10) can be equivalently rewritten as

{ Δ M A X 2A Λ 2 +Δ K A X 2A =0, Δ M S X 2S Λ 2 +Δ K S X 2S =0, (11)

which is the no spill-over property.

Lemma 1. [20] Let X , J n×n be defined by (4) and (5), respectively. Partition X as X=[ X A X S ] , X A n A ×n , X S n S ×n . There exist nonsingular matrices M and K of the form (2) such that (6) holds, if and only if [ X A X S J ] is nonsingular and there exists a nonsingular matrix ΓS n×n satisfying

Γ J T =JΓ, X A Γ X S T =0. (12)

And in this case, the matrices M and K can be expressed as

M A = ( X A Γ X A T ) 1 , M S = ( X S Γ J T X s T ) 1 , (13)

K A = ( X A Γ J T X A T ) 1 , K S = ( X S Γ X S T ) 1 , (14)

C AS = ( X A Γ X A T ) 1 X A Γ J T X S T ( X S Γ J T X s T ) 1 , (15)

C SA T = ( X A Γ J T X A T ) 1 X A Γ J T X S T ( X S Γ X S T ) 1 , (16)

and it holds that C AS = C SA T .

Theorem 2. Suppose that ( J,X ) defined by (4) and (5) is a Jordan pair of P( λ ) . Let

Γ 1 = ( [ X 1A T Λ 1 T X 1S T ][ M A C AS 0 M S ][ X 1A X 1S ] ) 1 . (17)

Then the MUP-UVA can avoid spill-over, i.e., (11) is satisfied if and only if Δ and ΔK jointly satisfy the following matrix equation:

[ Δ,ΔK ]=0, (18)

where

=[ M A 1 X 1A Γ 1 X 1A T M A 1 C AS M S 1 X 1A Λ 1 Γ 1 X 1S T X 1S Γ 1 X 1A T M S 1 X 1S Λ 1 Γ 1 X 1S T K A 1 X 1A Λ 1 1 Γ 1 X 1A T X 1A Γ 1 X 1S T K S 1 C SA K A 1 X 1S Λ 1 1 Γ 1 X 1A T K S 1 X 1S Γ 1 X 1S T ], (19)

with rank( )=np .

Proof. (Necessity) Since ( J,X ) is a Jordan pair of P( λ ) , we have

MXJ+KX=0,

and [ X A X S J ] is nonsingular. It follows from Lemma 1 that there exists a nonsingular matrix ΓS n×n such that (12)-(16) hold. Since

σ( Λ 1 )σ( Λ 2 )= , the matrix Γ must be of block diagonal form Γ=diag( Γ 1 , Γ 2 ) , which satisfy

Λ 1 Γ 1 = Γ 1 Λ 1 T , Λ 2 Γ 2 = Γ 2 Λ 2 T , (20)

where Γ 1 is given by (17). Substituting the partitions of X and J given by (7) into (13) and (14), we can obtain that

X 2A Γ 2 X 2S T = X 1A Γ 1 X 1S T , (21)

X 2A Γ 2 X 2A T = M A 1 X 1A Γ 1 X 1A T , (22)

X 2S Λ 2 Γ 2 X 2S T = M S 1 X 1S Λ 1 Γ 1 X 1S T , (23)

X 2A Λ 2 1 Γ 2 X 2A T = K A 1 X 1A Λ 1 1 Γ 1 X 1A T , (24)

X 2S Γ 2 X 2S T = K S 1 X 1S Γ 1 X 1S T , (25)

X 2A Λ 2 Γ 2 X 2S T = M A 1 C AS M S 1 X 1A Λ 1 Γ 1 X 1S T , (26)

X 2A Λ 2 1 Γ 2 X 2S T = K A 1 C SA T K S 1 X 1A Λ 1 1 Γ 1 X 1S T . (27)

Pre-multiplying (26) and (21) by Δ M A and Δ K A , respectively, we can get

( Δ M A X 2A Λ 2 +Δ K A X 2A ) Γ 2 X 2S T := H 1 , (28)

where H 1 =Δ M A ( M A 1 C AS M S 1 X 1A Λ 1 Γ 1 X 1S T )Δ K A ( X 1A Γ 1 X 1S T ) . Pre-multiplying (23) and (25) by Δ M S and Δ K S , respectively, we have

( Δ M S X 2S Λ 2 +Δ K S X 2S ) Γ 2 X 2S T := H 2 , (29)

where H 2 =Δ M S ( M S 1 + X 1S Λ 1 Γ 1 X 1S T )+Δ K S ( K S 1 X 1S Γ 1 X 1S T ) . Similarly, Pre-multiplying (22) and (24) by Δ M A and Δ K A , respectively, we can obtain that

( Δ M A X 2A Λ 2 +Δ K A X 2A ) Λ 2 1 Γ 2 X 2A T := H 3 , (30)

where H 3 =Δ M A ( M A 1 X 1A Γ 1 X 1A T )Δ K A ( K A 1 + X 1A Λ 1 1 Γ 1 X 1A T ) . Transposing both sides of Equations (21), (27) and pre-multiplying by Δ M S and Δ K S , respectively, we can obtain that

( Δ M S X 2S Λ 2 +Δ K S X 2S ) Λ 2 1 Γ 2 X 2A T := H 4 , (31)

where H 4 =Δ M S ( X 1S Γ 1 X 1A T )+Δ K S ( K S 1 C SA K A 1 X 1S Λ 1 1 Γ 1 X 1A T ) . It is easy to verify that (28)-(31) can be rewritten as

AB=[ H 3 H 1 H 4 H 2 ], (32)

where B=[ Λ 2 1 Γ 2 X 2A T Γ 2 X 2S T ] ( np )×n and

A=[ Δ M A X 2A Λ 2 +Δ K A X 2A Δ M S X 2S Λ 2 +Δ K S X 2S ] n×( np ) .

Obviously, A=0 since (11) holds. It follows from (32) that (18) is satisfied.

(Sufficiency.) Suppose that (18) holds. We can see from (32) that AB=0 , and it follows from the Sylvester’s rank inequality that

rank( A )+rank( B )np. (33)

Since [ X A X S Λ ] , Λ 2 and Γ 2 are nonsingular, it follows from (20) that

rank( B T )=rank[ X 2A Γ 2 Λ 2 T X 2S Γ 2 ]=rank[ X 2A X 2S Λ 2 ]=np. (34)

It is easy to see from (33) that A=0 , which implies that (11) holds.

Substituting (21)-(27) into (19) we have

=[ X 2 Λ 2 X 2 ] Γ 2 [ Λ 2 T X 2A T X 2S T ]. (35)

Since X and [ X A X S Λ ] are nonsingular, which implies that the 2n×( np ) matrix [ X 2 X 2 Λ 2 ] and n×( np ) matrix [ X 2A Λ 2 1 X 2S ] are all of full column rank. We can see from (20) that Γ 2 is nonsingular. It follows from (35) that rank( )=np .

3. Solvability of the MUP-UVA

From the definitions of the matrices Δ and ΔK , it is easy to verify that (18) is equivalent to the following two equations

[ Δ M A ,Δ K A ] A =0, (36)

[ Δ M S ,Δ K S ] S =0, (37)

where A 2 n A ×n is composed of the first and third columns of and S 2 n S ×n is composed of the second and fourth columns of . Without loss of generality, we assume that rank( A )= s 1 and rank( S )= s 2 . By Theorem 2, we have s 1 + s 2 =np . Let the QR decompositions of A and S be given by

A =Q[ R 0 ], S =P[ R 0 ], (38)

where Q:=[ Q 1 , Q 2 ] 2 n A ×2 n A and P:=[ P 1 , P 2 ] 2 n S ×2 n S are orthogonal matrices with Q 2 2 n A ×( 2 n A s 1 ) , P 2 2 n S ×( 2 n S s 2 ) , and R s 1 ×n , R s 2 ×n are of full row rank. Next, we characterize the parametric solutions of the MUP-UVA in terms of Y .

Theorem 3. Let ( Λ 1 , X 1 ) be defined by (7), and ( Σ 1 ,Y ) p×p × n×p be the real representation of the prescribed eigenpairs { μ j , y j } j=1 p . Suppose that 1pmin{ 2 n A s 1 ,2 n S s 2 } . Partition Q 2 and P 2 as Q 2 =[ Q 21 , Q 22 ] and P 2 =[ P 21 , P 22 ] , where Q 22 2 n A ×p and P 22 2 n S ×p . If the p×p matrices

Z A := Q 22 T [ Y A Σ 1 Y A ], (39)

Z S := P 22 T [ Y S Σ 1 Y S ], (40)

are nonsingular, then the Δ , ΔK defined by

[ Δ M A ,Δ K A ]=( M A Y A Σ 1 + K A Y A + C AS Y S Σ 1 ) Z A 1 Q 22 T , (41)

[ Δ M S ,Δ K S ]=( M S Y S Σ 1 + K S Y S + C SA Y A ) Z S 1 P 22 T , (42)

are real and solve the MUP-UVA. And in this case, Y is the matrix of eigenvectors corresponding to Σ 1 .

Proof. Let

U:=[ U 1 , U 2 ] = [Δ M A ,Δ K A ]Q, (43)

where U 1 n A × s 1 , U 2 n A ×( 2 n A s 1 ) . It follows from (36) that

[ Δ M A ,Δ K A ] A =[ U 1 , U 2 ][ R 0 ]=0, (44)

which indicates that U 1 =0 . Furthermore,

[ Δ M A ,Δ K A ]=[ U 1 , U 2 ] Q T = U 2 Q 2 T , (45)

where U 2 can be further determined that (8) is satisfied. Let U 2 =[ U 21 U 22 ] , where U 21 n A ×( 2 n A s 1 p ) , U 22 n A ×p . we set U 21 =0 . Form the partition of Q 2 , we can see from (45) that

[ Δ M A ,Δ K A ]= U 22 Q 22 T , (46)

Substituting (46) into (8) gives

U 22 Z A =( M A Y A Σ 1 + K A Y A + C AS Y S Σ 1 ). (47)

Since Z A is nonsingular, it follows from (47) that (41) is satisfied. Similarly, by the QR decomposition of S , we can prove that (42) holds.

In practice, we tend to seek the minimum norm solution which can be obtained by the following problem:

min Y n×p J:= J A + J S , (48)

where J A = 1 2 ( Δ M A F 2 + Δ K A F 2 ) and J S = 1 2 ( Δ M S F 2 + Δ K S F 2 ) . Clearly, this is an unconstrained optimization problem which can also be solved by the MATLAB function fminunc. Next, we provide the gradient formula of J with respect to Y .

Theorem 4. Suppose that the QR decompositions of A is given by (38). Let [ Δ M A ,Δ K A ]=D Q 22 T , where D=( M A Y A Σ 1 + K A Y A + C AS Y S Σ 1 ) Z A 1 with Z A being defined by (39). Partition Q 22 as Q 22 T =[ Q 31 , Q 32 ] , where Q 31 , Q 32 p× n A . Let V= ( V 1 V 2 ) T , where

V 1 =[ Σ 1 Z A 1 D T M A Z A 1 D T K A , Σ 1 Z A 1 D T C AS ], (49)

V 2 =[ Σ 1 Z A 1 D T D Q 31 + Z A 1 D T D Q 32 , 0 p× n S ]. (50)

Then the gradient Y J A of J A with respect to Y is given by

Y J A =V. (51)

Proof. From (41), we can obtain that

[ Δ M A ,Δ K A ]= [ 0 n A ×( 2 n A p ) ,DQ ] T , (52)

Recall that Q is an 2 n A ×2 n A orthogonal matrix, then J A can be rewritten as

J A = 1 2 tr( D T D ). (53)

Now, we establish the gradient Y J A of J A . Taking the differential of both sides of J A , we can obtain that

Δ J A = 1 2 tr( Δ D T D )+ 1 2 tr( D T ΔD ). (54)

Again, taking the differential of both sides of

D Z A =( M A Y A Σ 1 + K A Y A + C AS Y S Σ 1 ),

we have

ΔD Z A +DΔ Z A =( M A Δ Y A Σ 1 + K A Δ Y A + C AS Δ Y S ). (55)

Note that Z A is nonsingular, then we have

ΔD=[ ( M A Δ Y A Σ 1 + K A Δ Y A + C AS Δ Y S Σ 1 )DΔ Z A ] Z A 1 . (56)

From (56), we have

tr( D T ΔD ) =tr( D T [ ( M A Δ Y A Σ 1 + K A Δ Y A + C AS Δ Y S Σ 1 )DΔ Z Y ] Z Y 1 ) =tr( Z Y 1 D T [ ( M A Δ Y A Σ 1 + K A Δ Y A + C AS Δ Y S Σ 1 )DΔ Z Y ] ) =tr( ( Σ 1 Z Y 1 D T M A Z Y 1 D T K A )Δ Y A )tr( Σ 1 Z Y 1 D T C AS Δ Y S ) tr( Z Y 1 D T DΔ Z Y ) =tr( V 1 ΔY )tr( Z Y 1 D T DΔ Z Y ). (57)

We now show that the second term of (57) can also be expressed in terms of ΔY . Substituting the partition of Q 22 into Z Y defined by (39), we have

Z A = Q 31 Y A Σ 1 + Q 32 Y A . (58)

It follows that

Δ Z A = Q 31 Δ Y A Σ 1 + Q 32 Δ Y A , (59)

which implies that

tr( Z A 1 D T DΔ Z A )=tr( Z A 1 D T D( Q 31 Δ Y A Σ 1 + Q 32 Δ Y A ) )=tr( V 2 ΔY ). (60)

From (57) and (60), we can obtain that

tr( D T ΔD )=tr( ( V 1 V 2 )ΔY )=tr( V T ΔY ). (61)

Similar to the proof of (61), the term tr( DΔ D T ) in (54) can be express by ΔY as:

tr( DΔ D T )=tr( ( V 1 T V 2 T )Δ Y T )=tr( VΔ Y T ). (62)

Substituting (54) and (61) into (62) gives

Δ J A = 1 2 tr( V T ΔY )+ 1 2 tr( VΔ Y T )= V,ΔY ,

which implies that the gradient of J A is given by (51).

Similar to the proof of Theorem 4, we can prove the following theorem.

Theorem 5. Suppose that the QR decompositions of S is given by (38). Let [ Δ M S ,Δ K S ]=T P 22 T , where T=( M S Y S Σ 1 + K S Y S + C SA Y A ) Z S 1 with Z S being defined by (40). Partition P 22 as P 22 T =[ P 31 , P 32 ] , where P 31 , P 32 p× n S . Let N= ( N 1 N 2 ) T , where

N 1 =[ Σ 1 Z S 1 T T M S Z S 1 T T K S , Σ 1 Z S 1 T T C SA ],

N 2 =[ Σ 1 Z S 1 T T T P 31 + Z S 1 T T T P 32 , 0 p× n A ].

Then the gradient Y J S of J S with respect to Y is given by

Y J S =N.

4. Numerical Examples

In this section, we give some numerical examples to verify the performance of Algorithm 1. All calculations were carried out using MATLAB R2023b. We compute the relative residuals of the updated system ( Res. U k ) as

Algorithm 1. Finding the minimum solution of the MUP-UVA.

Res.U= M ˜ Y Σ 1 + K ˜ Y F ( M ˜ F Σ 1 F + K ˜ F ) Y F , (63)

and the relative residuals of the original system  Res. O k as

Res.O= M X 2 Λ 2 +K X 2 F ( M F Λ 2 F + K F ) X 2 F . (64)

Example 1. [15] In this example, we consider an undamped vibroacoustic system which is modified from a finite element model of a three-dimensional rectangular-box cavity backed by a flexible plate with n A =336, n S =60 . In the raw data, the stiffness matrix K A is singular, and the magnitude of the elements in the acoustic and structural matrices vary greatly. Those in the acoustic mass matrix M A is of order O( 10 10 ) , while those in the structural mass matrix M S is of orders O( 10 5 ) to O( 10 2 ) . Those in the acoustic stiffness matrix K A is of order O( 10 2 ) , while in the structural stiffness matrix K S is of order O( 10 5 ) . And those in the acoustic-structural coupling matrix C AS is of order O( 10 5 ) . Therefore, the eigenvalues of P( λ ) in (3) are of order O( 10 9 ) . So we choose n A =335 and n S =60 and balance these matrices by setting

M ^ := 10 8 M×T, K ^ :=K×T,

and λ:= 10 8 λ , where T=diag( 10 2 I n A , 10 6 I n S ) . After this balancing, the matrices M ^ and K ^ are nonsingular, and the elements in the matrices are all of analogous order, and the eigenvalues are of normal order. All eigenvalues of the original system P ^ ( λ )=λ M ^ + K ^ are real.

Suppose that we update 8 eigenvalues of original system

λ 1 =12.3512, λ 2 =12.1400, λ 3 =11.7411, λ 4 =11.3875,

λ 5 =11.3389, λ 6 =11.1312, λ 7 =11.1490, λ 8 =11.0803.

to the following 4 pairs of complex conjugate eigenvalues

μ 1,2 =±3.0544i, μ 3,4 =±6.2118i, μ 5,6 =±2.7988i,

where μ 1,2 are of algebraic multiplicity two. We choose Y randomly, and compute the coefficient matrices Δ M A , Δ M S , Δ K A and Δ K S by Algorithm 3.2 in [16], Theorem 3, fminunc and Algorithm 1, respectively. Numerical results are shown in Table 1, which means that all the prescribed eigenvalues are embedded perfectly into the updated system and the remaining eigenpairs of the original system are kept unchanged. We can also see from Table 1 that the errors of updates computed by the Algorithm 1 are smaller, i.e., the proposed algorithm in our paper is more efficient for the minimum solution of the PMP-UVA.

Table 1. Numerical result for Example 1.

Alg

Δ M A F

Δ M S F

Δ K A F

Δ K S F

Res.U

Res.O

IT.

CT.

Algorithm 3.2 [16]

362.4999

13.7043

2.4e + 03

120.5830

1.9176e−15

6.0511e−14

-

1.1477

Theorem 3

210.7100

6.9986

63.3163

14.9833

2.9799e−17

1.1275e−14

-

0.7024

fminunc

101.6430

3.7118

36.3769

7.3134

2.0297e−17

9.5218e−15

8

30.2630

Algorithm 1

34.8851

3.2175

10.7382

2.06446

1.4559e−17

4.5676e−15

14

9.07322

Example 2. In this example, the matrices M A , M S , K A , K S , C AS and C SA are the same as in Example 1. We update p (varying from 2 to 38 at increment 4) eigenvalues to μ j that are generated randomly, and μ j need not to be simple. We apply fminunc and Algorithm 1, respectively, to get the updated systems.

Numerical results are illustrated in Figure 1 and Figure 2. These results are rather close, or at least comparable, for all p . The relative errors of modifications on Δ M A , Δ M S , Δ K A and Δ K S are listed in Figures 3-6, respectively, which show the norms of the modifications computed by Algorithm 1 are smaller than those obtained by fminunc. Therefore, we can conclude that Algorithm 1 is more efficient for getting the minimum norm solutions of the MUP-UVA.

Figure 1. Res.U of updated systems in Example 2.

Figure 2. Res.O of updated systems in Example 2.

Figure 3. Relative errors of updates on M A in Example 2.

Figure 4. Relative errors of updates on M S in Example 2.

Figure 5. Relative errors of updates on K A in Example 2.

Figure 6. Relative errors of updates on K S in Example 2.

5. Conclusions and Suggestions

A new model updating method for the undamped vibroacoustic system with no spill-over is provided in this paper. Using the spectral decomposition of a structured asymmetric pencil, a sufficient and necessary condition is derived from which the updated undamped vibroacoustic system can preserve no spill-over. Finally, a gradient-based optimization algorithm for the minimum norm solution of the MUP-UVS is proposed. Numerical examples illustrate the effectiveness the proposed algorithm.

Acknowledgements

This work is supported by the Research Foundation of Education Department of Hunan Province (Grant No. 23A0266), Hunan Provincial Natural Science Foundation (Grand No. 2025JJ50034). Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering (Grant No. 2017TP1017).

Notations and Assumptions

  • λ 1 , λ 2 ,, λ n —eigenvalues of the model ( M,K ) .

  • Λ 1 =diag( λ 1 , λ 2 ,, λ p ) —diagonal matrix of eigenvalues to be reassigned.

  • X 1 =[ x 1 ,, x p ] —matrix of eigenvectors corresponding to Λ 1 .

  • Λ 2 =diag( λ p+1 , λ p+2 ,, λ n ) —diagonal matrix of remaining eigenvalues to be kept unchanged.

  • X 2 =[ x p+1 ,, x n ] —matrix of eigenvector corresponding to Λ 2 .

  • Σ 1 =diag( μ 1 ,, μ p ) —diagonal matrix of measured eigenvalues.

  • Y=[ y 1 ,, y p ] —matrix of eigenvectors corresponding to Σ 1 .

  • m×n —the set of all complex m×n matrices over .

  • m×n —the set of all real m×n matrices over .

  • S n×n —the set of all symmetric matrices in n×n .

  • tr( A ) —the trace of matrix A .

  • A F —Frobenius norm of the matrix A .

In this paper, we will make the following assumptions.

(A1) The matrices M and K are nonsingular.

(A2) All the eigenvalues of Λ 1 , Λ 2 and Σ 1 are nonzero.

(A3) σ( Λ 1 )σ( Λ 2 )= , σ( Λ 1 )σ( Σ 1 )= .

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Belotti, R., Ouyang, H. and Richiedei, D. (2018) A New Method of Passive Modifications for Partial Frequency Assignment of General Structures. Mechanical Systems and Signal Processing, 99, 586-599.[CrossRef]
[2] Richiedei, D. and Tamellin, I. (2021) Active Control of Linear Vibrating Systems for Antiresonance Assignment with Regional Pole Placement. Journal of Sound and Vibration, 494, Article 115858.[CrossRef]
[3] Friswell, M. and Mottershead, J.E. (1995) Finite Element Model Updating in Structural Dynamics. Kluwer Academic Publishers.
[4] Ram, Y.M., Mottershead, J.E. and Pilkey, D. (1998) The Direct Updating of Damping and Stiffness Matrices. AIAA Journal, 36, 491-493.
[5] Kuo, Y., Lin, W.W. and Xu, S.F. (2006) New Methods for Finite Element Model Updating Problems. AIAA Journal, 44, 1310-1316.[CrossRef]
[6] Kuo, Y. and Datta, B.N. (2012) Quadratic Model Updating with No Spill-Over and Incomplete Measured Data: Existence and Computation of Solution. Linear Algebra and its Applications, 436, 2480-2493.[CrossRef]
[7] Chu, M.T., Lin, W. and Xu, S. (2007) Updating Quadratic Models with No Spillover Effect on Unmeasured Spectral Data. Inverse Problems, 23, 243-256.[CrossRef]
[8] Chu, M. and Lin, W.W. (2009) Quadratic Model Updating with Symmetry, Positive Definiteness, and No Spill-Over. SIAM Journal on Matrix Analysis and Applications, 31, 546-564.[CrossRef]
[9] Moreno, M., Datta, B.N. and Raydan, M. (2009) A Symmetry Preserving Alternating Projection Method for Matrix Model Updating. Mechanical Systems and Signal Processing, 23, 1784-1791.[CrossRef]
[10] Chu, M.T., Datta, B., Lin, W.W. and Xu, S.F. (2008) Spillover Phenomenon in Quadratic Model Updating. AIAA Journal, 46, 420-428.[CrossRef]
[11] Mao, X.B. and Dai, H. (2012) Finite Element Model Updating with Positive Definiteness and No Spill-Over. Mechanical Systems and Signal Processing, 28, 387-398.[CrossRef]
[12] Zhao, K. and Liao, A.P. (2020) Updating the Undamped Piezoelectric Smart Structure System with No-Spillover. Applied Mathematics Letters, 107, Article 106435.[CrossRef]
[13] Zhao, K., Cheng, L.Z. and Liao, A.P. (2018) Updating-Palindromic Quadratic Systems with No Spill-Over. Computational and Applied Mathematics, 37, 5587-5608.[CrossRef]
[14] Ganai, T. and Adhikari, B. (2022) Eigenvalue Embedding Problem for Quadratic Regular Matrix Polynomials with Symmetry Structures. Linear Algebra and Its Applications, 640, 118-148.[CrossRef]
[15] Modak, S.V. (2014) Direct Matrix Updating of Vibroacoustic Finite Element Models Using Modal Test Data. AIAA Journal, 52, 1386-1392.[CrossRef]
[16] Zhao, K. and Liu, Z.Y. (2023) Eigenvalue Embedding of Damped Vibroacoustic System with No-Spillover. SIAM Journal on Matrix Analysis and Applications, 44, 1189-1217.[CrossRef]
[17] Guo, Z., Qian, J., Cai, Y. and Xu, S.F. (2016) Refined Schur Method for Robust Pole Assignment with Repeated Poles. IEEE Transactions on Automatic Control, 61, 2370-2385.[CrossRef]
[18] Zhao, K. and Liu, J. (2024) Updating the Quadratic Asymmetric Vibration System with No-Spillover. Applied Mathematical Modelling, 127, 379-395.[CrossRef]
[19] Gohberg, I., Lancaster, P. and Rodman, L. (1982) Matrix Polynomials. Academic Press.
[20] Qian, J., Cai, Y.F., Chu, D. and Tan, R.C.E. (2017) Eigenvalue Embedding of Undamped Vibroacoustic Systems with No-Spillover. SIAM Journal on Matrix Analysis and Applications, 38, 1190-1209.[CrossRef]
[21] Nocedal, J. and Wright, S. (1999) Numerical Optimization. Springer.

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.