Code - Aster r5.01.02-1

Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : /"2
Responsable : #li$ier %#&TE'( )l : R5*0*02 R$ision : +2,0
Problem resolution modal
quadratic (QEP)
Rsum
the study of the dynamic stability of a damped and/or revolving structure leads to the resolution of a modal
problem higher than the traditional standard modal problems (SEP) or generalized (GEP).
To apprehend them Code_Aster proposes a string of methods via operators MODE_ITER_INV and
MODE_ITER_SIMULT! po"ers opposite and method of #$ller %anczos &'( and )*. They have each one their
perimeter of use their advantages/disadvantages and their history of development.
&n the first part of the document "e summarize the problems of resolution of a +uadratic problem and its
variation in the general architecture of a modal computation )ode-'ster . Then "e detail the numerical data,
processing and functional aspects of each approach available in the code. The various results algorithms or
parameters approached in this document are often based on the modal methods of orders lo"er (SEP and
GEP) described in the document -'../0./01. The reading of this last is thus pre,necessary advised.
.arnin! : T/e translation pro0ess used on t/is 1ebsite is a 23a0/ine Translation2* &t ma4 be impre0ise and ina00urate in 1/ole or in part
and is pro$ided as a 0on$enien0e*
5i0ensed under t/e terms o6 t/e 78( 9D5 (/ttp://111*!nu*or!/0op4le6t/6dl*/tml)
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2/"2
Table des Matires
0 &ntroduction2...........................................................................................................................................
3 4onte5te6...............................................................................................................................................
3.0 Probl7mati+ue6................................................................................................................................
3.3 Properties of the modes propres8....................................................................................................
3.9 Sp7cificit7s of the )EP and elements of th7orie:............................................................................
3.2 Strat7gie of lin7arisation0/...............................................................................................................
3.2.0 &ntroduction0/.........................................................................................................................
3.2.3 Principe0/...............................................................................................................................
3.2.9 )uel+ues e5emples00............................................................................................................
3.2.2 Strat7gies retained in 4ode;(ster03......................................................................................
3.. &mplantation in 4ode;(ster09..........................................................................................................
3...0 Pre,processing (linearization computation of the shift)..................................................... 09
3...3 <actorisation of matri5es dynami+ues02.................................................................................
3...9 4omputation modal02.............................................................................................................
3...2 Post,processing of v7rification0.............................................................................................
3.... (ffichage in the file message0...............................................................................................
9 #7thode of the po"ers opposite (#=>E;&TE';&?@)....................................................................... 08
9.0 &ntroduction08..................................................................................................................................
9.3 #7thode de............................................................................................................. #$ller,Traub08
9.9 #7thode of the po"ers opposite (alternative of Aennings).......................................................... 0B
9.2 P7rimCtre of utilisation0:..................................................................................................................
9.. (ffichage in the file message0:.......................................................................................................
9.6 '7capitulatif of the param7trage3/..................................................................................................
2 #7thode of subspace (#ETD=>EEFT'&;>&(GF/FS='E?SE?F)......................................................... 30
2.0 =f the )EP "ith the SEP30.............................................................................................................
2.0.0 Transition )EP/GEP! lin7arisation30......................................................................................
2.0.3Passage GEP/SEP! transformation spectrale30......................................................................
2.3 &mplantation in 4ode;(ster .............................................................................................................
33.2.3.0 4hoi5 of the shift spectral33...............................................................................................
2.3.3 4omputation of the operator and the scalar product of travail39............................................
2.9 P7rimCtre of utilisation32..................................................................................................................
2.2 (ffichage in the file message32.......................................................................................................
2.. '7capitulatif of the param7trage32..................................................................................................
. #7thode total )* (#ETD=>EEF)*F)................................................................................................. 36
..0 =f the )EP "ith the GEP36.............................................................................................................
..3 P7rimCtre of utilisation36..................................................................................................................
..9 Printings in the file message36........................................................................................................
..2 '7capitulatif of the param7trage36..................................................................................................
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : "/"2
6 Gibliographie3B.......................................................................................................................................
6.0 %ivres/articles/proceedings/thesesH........................................................................................... 3B
6.3 'apports/account,returned E><3B..................................................................................................
6.9 'essources internet3B.....................................................................................................................
8 >escription of the versions of the document3:.......................................................................................
(nne5e 0 &nterpr7tation of the eigenvalues comple5es9/.........................................................................
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : ,/"2
1 ntroduction
Ine maJority of study concerning damped and!or the d"namic re#ol#ing structure beha#ior are
carried out by carrying out a transient anal"sis on modal base. To e5hume these modes of
vibrations a string of algorithms have been developed for about si5ty years. &n order to face the
continual increase in the size of the problems and "ith the degradation of conditionings of the
discretized operators only most effective and most ruggedized in practice "ere built,in the t"o modal
operators of )ode-'ster! MODE_ITER_SIMULT and MODE_ITER_INV.
The optimal perimeters of use of these operators can be dissociated. Khen it is a +uestion of
determining some eigen#alues (typically a half,dozen) or of refining some estimates operator
MODE_ITER_INV is completely indicated. De gathers heuristic algorithms and those of type po"ers (cf
L9).
=n the other hand to capture a significant part of the spectrum$ one has resorts to
MODE_ITER_SIMULT. This last federates the methods Mno"n as of NsubspaceO (%anczos &'(# L2)
"hich proJect the operator of "orM in order to obtain an appro5imated modal problem of more reduced
size (treated then by a global method of the type QR).
This operator also allo"s to e5hume in a ruggedized "ay all the spectrum of the modal problem. <or
this maMing one uses a total method of reference (method Q% cf L2) "hich calculates all the modes
e5haustively. &t is thus to hold for certain uses! problem of small size (P 0/// ddls) or benchmarM of
algorithms.
The t"o operators can be complementary besides because the methods implementations in
MODE_ITER_INV are very po"erful to optimize eigen modes already almost converged. &n one or t"o
iterations they can thus improve the eigenvectors estimated beforehand $ia MODE_ITER_SIMULT.
ProJection on modal base "ill be only betterQ
&n the first part of the document "e summarize the problems of resolution of a +uadratic problem and
its variation in the general architecture of a modal computation )ode-'ster. Then "e detail the
numerical data,processing and functional aspects of each approach available in the code. =ne tries to
give for each method his main properties and his limitations by connecting these considerations
"hich can sometimes appear a little NetherealO to a precise parameter setting of the operators 'ster.
The various results algorithms or parameters approached in this document are often based on the
modal methods of order lo"er (SEP and GEP) described in the document -Goi/:1. The reading of this
last is thus pre,necessary advisedQ
&perator!
Perimeter of
application
'lgorithme (ord)*e" '#antages ncon#nients
Remarques
MODE_ITER_INV
0st phase
(heuristic)
symmetric Ini+uement
real
4omputation of some
modes
#$ller,Traub
` AJUSTE'
4ost (m7lioration
computation of some
&nitialisation
estimates by
the user
` PROCHE'
'ecovery of
eigenvalues
estimated by
another process.
4ost computation
of this phase +uasi,
no one
Pas of capture of
multiplicity
3nd phase
(method of the po"ers
itself)
symmetric Ini+uement
real
Code_Aster
Version
default
&perator!
Perimeter of
application
'lgorithme (ord)*e" '#antages ncon#nients
Remarques
#7thode basic Po"ers
opposite
(Aennings)
` DIRECT'
@ery good
construction of
eigenvectors
robust Peu
MODE_ITER_SIMULT
%anczos
`
TRI_DIAG'
=nly symmetric reality
&'(#
(Sorensen)
`
SORENSEN'
&ncreased
robustness.
Getter comple5ities
computation and
memory.
)uality control of
the modes.
#ethod by default.
'ange into asymmetric
and/or "ith '
comple5.
4omputation of all the
spectrum then filtering
of a part
)*
` QZ'
'obustness.
#ethod of
reference.
@ery e5pensive in
4PI and memory.
( reserve for the small
case (P0/9 degrees of
freedom).
'ange into asymmetric
and/or "ith '
comple5.
Table :* ;ummar4 o6 t/e modal met/ods to treat t/e QEP o6 )ode-'ster*
+ote,
T/e e66e0ti$e establis/ment and t/e maintenan0e o6 t/e modal sol$ers in )ode-'ster are t/e
6ruit o6 a team 1or<: D*;li!mann= %*Quinne>= 7*De$esa= #*%oiteau= #*8i0olas= E*%o4re=
&*8istor?
#ne tried 0onstantl4 to bind di66erent t/e items approa0/ed and to limit to t/e stri0t minimum
t/e re0ourse to lon! mat/emati0al demonstrations* &n an4 e$ent= t/e man4 re6eren0es 1/i0/
enamel t/e te@t must ma<e it possible to see< t/e a00urate in6ormation*
T/e obAe0t o6 t/is do0ument is not to detail all t/e aspe0ts approa0/ed= o6 t/e 0omplete 1or<s
/a$in! alread4 6ul6illed t/is mission* #ne 1ill 6ind man4 re6eren0es in t/e note B%oi0CD* #ne
1ill quote /o1e$er t/e e@0ellent s4nt/esis on t/e QEP made b4 9*Tisseur and E*3eerber!en
BT30D* #ur do0ument e@ploits some o6 its illustrati$e elements and= in parti0ular= some
e@amples*
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : +/"2
- .onte/te
-01 Problmatique
?ous let us consider the modal problem +uadratic ()EP)
Trouver (\, u) such as
(\
2
B+\C+A)u=0, u0
(3.0,0)
"here A, B i and C of the s+uare matri5es of size n "ith real or comple5 symmetric coefficients
or not. This Mind of problem corresponds in mechanics in particular under investigation of free
#ibrations of a damped and!or re#ol#ing structure. <or this structure one seeMs the eigenvalues
\
i
(and their associated eigenvectors u
i
) closest in the comple5 plane of a value of reference given
(the NshiftO c ) to Mno" if an e5iting force can create a resonance. &n this standard case
the matri5 A is the stiffness matri5 noted K symmetric real (possibly increased comple5
symmetric matri5 noted E
hyst
if the structure presents a hysteretic damping)! A=K+E
hyst
.
Thus A is symmetric real or comple5.
The matri5 B is the mass matri5 or of noted inertia M (symmetric real).
The matri5 C gathers it the possible gyroscopic effects and those of viscous damping $ia the
combination!
C:=E
visq
+(G (3.0,3)
"ith E
visq
matri5 (symmetric real) of damping induced by dissipative forces G stamps
gyroscopy (antisymmetric real) and ( a real parameter representative rotational speed. Thus C is
potentially asymmetric real.
This Mind of problems are activated by >R?(#&4 key word TYPE_RESU= `'. &n the general case of
the )EP (3.0,0) and by e5ploiting only their property of symmetry and arithmetic of the matri5es one
can breaM up the perimeter of the modal operators )ode-'ster as follo"s.

A ! C
'eal symmetric 'eal asymmetric 4omple5e
'eal symmetric 4as more running
SIMULT/INV "ithout
restriction on the methodsS
'eal,modes or
comple5es (\, \) .
SIMULT "ith T
SORENSEN'/'QZ'
'eal,modes or
comple5es (\, \) .
4ase untreated
'eal asymmetric SIMULT "ith T
SORENSEN'/'QZ'
'eal,modes or
comple5es (\, \) .
SIMULT "ith T
SORENSEN'/'QZ'
'eal,modes or
comple5es (\, \) .
4ase untreated
symmetric 4omple5e SIMULT "ith T
SORENSEN'/'QZ'
Inspecified real,modes
comple5es or (\, \) .
4ase untreated 4as untreated
(utres comple5es
(hermitian
asymmetricH)
4ase untreated 4as untreated 4as untreated
Tableau 2*:* Perimeter o6 use o6 t/e operators 'ster (MODE_ITER_SIMULT/INV) and t/eir met/ods o6
anal4sis (<e4 1ord METHODE) a00ordin! to properties
o6 t/e matri@es A and C o6 t/e QEP (2*:)* B is real unspe0i6ied*

Damped stru0ture ($is0ous)
nonre$ol$in! .
8onre$ol$in! stru0ture 1it/
/4stereti0 dampin!*
Re$ol$in! and/or damped
stru0ture ($is0ous)*
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : F/"2
&n absence of hysteretic damping the standard QEP to solve thus consists of s"mmetric real
matri/es. These eigenvalues either real or comple5 are combined per pair (\, \) . The eigenvectors
are then potentially "ith comple5 components.
&n the presence of hysteretic damping the )EP becomes comple5 and loses the property
pr7c7dente0Pour
0
. These modes then are real comple5 by pair or odd.
+ote,
)ontrar4 to t/e 7EP B%oi0CD treated b4 )ode-'ster= <e4 1ord TYPE_RESU= ` FLAMBEMENT' is not li0it in
t/e 6rame o6 t/e QEP*
%4 means o6 0omputer= t/e perimeter o6 operator MODE_ITER_SIMULT 1as e@tended to t/e real matri@es not
s4mtriquesdu A, B et C QEP* &t is not 4et t/e 0ase 6or MODE_ITER_INV 1/i0/ is limited= 6or time= 1it/
s4mmetri0 real matri@es* T/is last 0annot t/us ta<e into a00ount !4ros0opi0 e66e0ts*
T/e modeli>ation o6 dampin! B5e$C+D in )ode-'ster 0an brea< up into t1o 0lasses: $is0ous dampin!
proportional (<no1n as o6 Ra4lei!/ E
visq
:=oK+M ) or /4stereti0 dampin! ( E
hist
:=(1+i j) K )*
Ea0/ one is de0lined at t/e total le$el o6 stru0ture or b4 means o6 lo0alised depre0iation (mes/ !roups= ad
/o0 dis0rete elements)* T/e latter allo1in! to better represent t/e /etero!eneit4 o6 stru0ture 0ompared to
dampin!* Remain /o1e$er t/e deli0ate question o6 t/e identi6i0ation o6 t/e 0oe66i0ients (o, j) and
t/eir in6luen0es about t/e result*
-0- Properties of the eigen modes
preceding table 3.3,0 does not taMe account of typical cases (pure gyroscopy on,deadened
structureH). <or memory one "ill state of them some "hich one often finds in the literature. Gut it is
necessary "ell to Meep in memory that conte5t of the modelizations )ode-'ster (use +uasi,systematic
of %agranges double) and the sorting of eigen modes programmed in the modal operators do not taMe
account of these specificities. .urrentl" in QEP$ one retains onl" the coupled modes (\, \) and
one preser#es that at positi#e imaginar" part. (ccording to the cases the presence of eigenvalues
of other natures (real or comple5 not combined) is announced by !" ALARME or on a purely
informative basis.
=ne thus has (by taMing again the elements and the notations of the L9.9 of -Goi/:1 and paper -T#/01)
the distribution of the follo"ing properties. Those are sometimes cumulative. <igures 3.3,0 and 3.3,3
illustrate on canonical cases certain cases.
Properties of the
Propri7t7s
matri/es of the
Proprits
eigenvalues of the
E5emple
eigen#ectors of restrains
1ith the modeli2ations
Code_Aster
0
B not singular 2n finished \
eigenvalues
, Structure not locMed or
locMed by elimination
3
B singular 2n finished \ or
infinite eigenvalues
, Structure locMed by
dualisation
9
A, B and C real
'7elles or
per pair (\, \)
&f u eigenvector on
the right of \ then
u is that of \
NconventionalO )EP
(not of hysteretic damping)
2
A, B formula C
formula
'7elles or
per pair (\, \)
&f u eigenvector on
the right of \ then it
is also eigenvector
on the left of \
)EP "ithout gyroscopy
and "ith viscous damping
.
A, B et C
hermitian
B>0 and
A, C0
'e(\)0
, Structure free or locMed by
elimination "ith a damping
(dissipative) of 'ayleigh
and "ithout gyroscopy
0 to recover it one needs that the matri5es are for e5ample comple5es hermitian
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : G/"2
Properties of the
Propri7t7s
matri/es of the
Proprits
eigenvalues of the
E5emple
eigen#ectors of restrains
1ith the modeli2ations
Code_Aster
6
A, B and C
symmetric
B , C>0 and
A0
H )ondition o6 on:
dampin!
2

?egative real
spectrum broMen up
into t"o pacMages of
size n
n linearly
independent
eigenvectors are
associated "ith n
the greatest (or
smaller) Structure
eigenvalues free or locMed
by elimination "ith an ad
hoc dampin! and "ithout
gyroscopy
8
A and B
hermitian
C=C
3

(anti,hermitian)
B>0
&maginaire pure or
per pair (\,\)
&f u eigenvector on
the right of \ then it
is also eigenvector
on the left of \
Structure free or locMed by
elimination "ith gyroscopy
B
A et B
symmetrical real
>0
C=C
T

(antisymmetric)
&maginaire pure , ,
Tableau 2*2:* Properties o6 t/e modes o6 a standard QEP (o6 si>e n ) a00ordin! to
t/ose o6 its matri@es* Possible lin<s 1it/ t/e modalisations )ode-'ster*

9i!ure 2*2:* E@amples o6 t/e spe0trum o6 a QEP (n=8) o6 a simpli6ied model o6 nu0lear loudspea<er BT30D*
'ppear o6 le6t= one is in t/e 0ase nI" table 2*2:* T/at o6 strai!/t line= one t/us adds K 1it/ /4stereti0 dampin!
appear odd modes (!eneral 0ase nI)*
3 of on,damping :
( A, B, C) := min
x
2
=1
| ( x
3
Cx)
2
4( x
3
Mx) ( x
3
Kx) >0
*
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : C/"2

9i!ure 2*2:2* E@amples o6 t/e spe0trum o6 a QEP (n=50) o6 a damped s4stem mass:sprin!s BT30D* 'ppear
o6 le6t= one is in t/e 0ase nI5 table 2*2:* T/at o6 strai!/t line= one adds t/e stress o6 on:dampin! and t/e
spe0trum be0omes real ne!ati$e in t1o pa0<a!es (0ase nI+)*

-04 5pecificities of the QEP and elements of theor"
Ine ma6or algebraic specificit" bet"een the )EP and the other classes of modal problems of level
lo"er (GEP and SEP) is the e/istence of t1ice more eigen modes ( 2n ) that si2e of the
discreti2ed problem. The eigenvectors cannot be linearly independent any more in addition the
eigenvalues can finished or infinite and all Nthis small "orldO generally lives in the comple5e94 plane
9
.
The heuristic ruggedi2ed ones should then be defined to filter the eigen#alues desired b" the
user and to distinguish the real ones of the comple5es the odd comple5es of those coupledH
(nother complication inherent in the )EP is of order algorithmic. There does not e/ist
decomposition of 5chur (resp0 5chur generali2ed) as for the 5EP (resp0 7EP) on "hich "ill be
able to rest the algorithm of resolution. <or e5ample for the SEP Au=\u this decomposition the
e5istence of a unit matri5 ensures us (thus conditioned "ell and easily invertible) U allo"ing the
re"riting of the matri5 of "orM A in an easier form manipuler2%es
2
! the higher triangular matri5 T .

UAU
3
=T
(3.9,0)
The )EP thus constitute a very particular class and importante.>u
.
of the nonlinear problems. Their
resolution is less routine than for the other classes of modal problems. &n particular fe" methods maMe
it possible to solve the problem directly it is often necessary to for"ard by a GEP ($ia an ad hoc
lineari>ation) then a SEP (spectral transformation) "hat induces a loss of spectral information and
numerical instabilities (propagation of round,off errors).
&n the theoretical literature rather than in the )EP (3.0,0) one is interested in the matric pol"nomial
(+uadratic in \ )
Q(\):=(\
2
B+\C+A)
(3.9,3)
=ne it call also \)matrice or stamps d"namic and one seeMs his noted spectrum
spectre(Q) :=\C/ det Q(\)=0 . Khen this determinant is null "hatever \ is \)matrice
Mno"n as singular for it. &n the contrary case it is Mno"n as regular (one places oneself in general in
this frameQ).
9 Fis already the case for certain classes of GEP! asymmetric or "ith comple5 matri5
2 eigenvalues of the problem are found on the main diagonal of T and one can deduct easily of the vectors
of Schur (the vectors columns of Q ) their associated eigenvectors.
. maMes in particular these increasing applications in industry! analyzes vibratory vibro,accoustic mechanics
of the fluids "ith turbulence electronics (@%S&)H
Code_Aster
Version
default
The characteristic polynomial of the problem is thus "ritten in the form
det Q(\)=det (M)\
2n
+

terms of a lo"er nature in \ . Thus as soon as M is singular this polynomial admits r2n finished
roots for "hich it is necessary to add 2nr infinite. &n addition these distinct eigenvalues can share
the same eigenvectors. &t is the Ndual situationO of the multiple eigenvalues of the SEP "here the same
eigenvalue is attached to several eigenvectors. Thus for the canonical )EP
A=I
3,
B=
|
0 6 0
0 6 0
0 0 1
et C=
|
1 6 0
2 7 0
0 0 0
(3.9,9)
there is the follo"ing spectrum
i 1 2 3 4 5 6
\
i
1/ 3 1/ 2 1 i i
u
i
|
1
1
0
|
1
1
0
|
0
1
0
|
0
0
1
|
0
0
1
|
1
0
0
(3.9,2)
>e la singularity of B comes the infinite eigenvalue. =ne notes also the sharing of eigenvectors by
the first t"o eigenvalues and 2th/.th.
To more easily apprehend the infinite eigenvalues of Q(\) one associates them "ith the null
eigenvalues of the opposite pol"nomial
rev Q(\):=\
2
Q
(
1
\
)
=( B+\C+\
2
A) (3.9,.)
4es eigen#alues finished of rev Q(\) is easier 1ith compute and shares the same spectral
characteristics (multiplicities geometrical and algebraic clean spaceH) that initial infinite values.
<or further information on these theoretical aspects one "ill be able to consult for e5ample the "orMs
of P.%ancaster -G%'B31 -%TB.1 and the thesis of >.S.#acMey -#ac/61 (and its many bibliographical
references).
-08 5trateg" of ntroduction
-0801 lineari2ation
the standard approach to solve a modal problem is to transform it to reveal canonical matri5es
revealing the re+uired modes. <or e5ample the decomposition of Schur for the SEP or that
generalized for the GEP. Infortunately this practice cannot spread "ith the modal problems of a
higher nature. T"o solutions are offered then!
5ol#e the nonlinear problem directl" (root of polynomial factorization of \,matrice
methods of the ?e"ton typeH).
9ineari2e in a 7EP then treat this last $ia the adapted methods -Goi/:1.
The first strateg" is declined in MODE_ITER_INV (method of #$ller,Traub) to capture a first estimate
of the eigenvalues. =ne then blends it 1ith the follo1ing strateg" because to refine the estimates
and to accelerate convergence one calls upon a method of the type po"ers opposite (alternative of
Aennings) on the linearized )EP. 4ertain authors propose complete direct approaches. They are often
based on alternatives of ?e"ton. Gut their convergence is slo" (a mode at the same time) and not
al"ays assured (cf UublanovsMaya 0:8/ G.Peters V A.D.KilMinson 0:8: and (.'uhe 0:89).
The strateg" of lineari2ation is thus often pri#ileged. &t doubles the size of the modal problem to
treating changes its nature ("ith the risM to lose information spectrale6=n
6
) and introduced numerical
6 finds the solution e5act of a NGEP appro5imateO but the aforementioned does not correspond inevitably to
the e5act solution of a Nappro5imate )EPO because solvers GEP do not respect particular structure of the
linearized problem (cf -T#/01 L.).
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : /"2
instabilities (sensitivities to the errors of arrondis8%
8
and "ith the parameters num7ri+uesB%es
B
). Gut it
has the immense advantage of re,using all Nnumerical artilleryO already deployed for GEP:=n
:
.
=ne can thus capture all the spectrum simultaneously (cf method )* of MODE_ITER_SIMULT) or only
it left centered on an area interest (cf &'(# or %anczos) by resorting to the spectral transformation
idoine.
-080- Maintenant
principle "hich the conte5t "as brushed to consolidate itself "ith the terminology employed in the
literature one from no" on "ill simplify the notations by considering the )EP associated "ith
\,matrice
Q(\):=( \
2
M+\C+K) . This matri5 is also called Ndynamic matri5O in the Jargon of the
dynamician of structures (and in the data,processing documents/sources of )ode-'ster). &t is during
that described in the note dedicated to the GEP! Q(\):=( K\ M) .
:efinition 1
<rom a theoretical point of vie" to linearize Q(\) come do"n to be found another \,matrice (comple5
s+uare of size 2n ) of the type A\B such as there e5ist t"o different \,matrices ( E(\) and F(\) )
"ith non,zero constant determinant checMing the relation
|
Q(\) 0
n
0
n
I
n
=E(\) ( A\B) F(\)

(3.2,0)
%es matri5es A and B are called the matri5es NcompanionO of the linearization of the )EP.
4learly the spectrums of the )EP initialet ( Q(\)) that of its linearization ( A\B) coincide.
Do"ever this decomposition is not single and it is necessary to choose if possible that "hich!
Preser#e the properties of the initial matri5es (arithmetic symmetryH)
%ess sensiti#it" to the round)off errors ( NbacM"ard Das stableO! balanced "ell conditioned
invertible matri5esH)
Dandles canonical matri/es (identity triangularH)
(dapts to a broad perimeter of QEP (viscous damping gyroscopy on,dampingH).
( more intuitive manner to apprehend the techni+ues of linearization consists in introducing a change
of variable of the 0/4omme v=\u
0/
in (3.0,0) and to rearrange it in matric form!
(
|
0
n
I
n
K C
_
A
\
|
I
n
0
n
0
n
M
_
B
)
|
u
v
=0
2n
(3.2,3)
This Nvery conventionalO linearization re,enters in the frame of definition 0 if they are used \,matrices !
E(\):=
|
(C+\M) I
n
I
n
0
n

, F(\):=
|
I
n
0
n
\ I
n
I
n
(3.2,9)
&n fact the linearization of a )EP marries the general frame of that of the matric pol"nomials. Khile
posing Q(\):=
i=1
k
\
i
X
i
(here k=2, X
i
=M etc) one is al"ays ensured to find t"o linearizations
Mno"n as NcompanionsO of the form A
1
\B
1
and A
2
\ B
2
"ith
8 Fapplication of solver modal of GEP to a linearized )EP is not NbacM"ard stableO. &.e. this techni+ue has a
propensity to transmit/amplify the round,off errors.
B results can be sensitive to the various parameters of the modal solvers used in 6ine but more especially
"ith those of the t"o preprocessings! linearization and spectral transformation.
: made in the same "ay for transition GEP/SEP (-Goi/:1 L9.8)
0/ for the solutions of differential e+uations of the second order of the lo"er schoolQ
Code_Aster
Version
default
B
1
=B
2
:=
|
X
k
0
( k1) n
0
( k1) n
I
( k1) n
,
A
1
:=
|
X
k1
X
k 2
... X
0
I
n
0
n
... 0
n
... ... ... ...
0
n
... I
n
0
n

, A
2
:=
|
X
k 1
I
n
... 0
n
X
k 2
0
n
... ...
... ... ... I
n
X
0
0
n
... 0
n

(3.2,2)
En prati+ue one prefers to them linearizations more adapted to the treated case (cf ne5t paragraph).
-0804 5ome :ans
e5amples the literature it is often question of the follo1ing lineari2ations ("ith N a comple5
s+uare regular matri5 of size n )!
(
L
1
)
(
|
0
n
N
K C
_
A
\
|
N 0
n
0
n
M
_
B
)
|
u
\u
=0
2n
(3.2,.)
( L
2
)
(
|
K 0
n
0
n
N
_
A
\
|
C M
N 0
n
_
B
)
|
u
\u
=0
2n
(3.2,6)
choices depends on the potential singularity of the matriceset K M. =ne "ishes to be able to reverse
the diagonal terms therefore if K is singular (resp. M) one uses ( L
1
) (resp. ( L
2
)). To balance
the terms of the matri5es and to facilitate handling one often taMes N=oI
n
"ith o real factor of
balancing (cf -Goi/:1 appendi5 0) built on the standard basis matric of the other terms
o=o(K,M,C) . To "orM "ith a symmetric GEP (even definite or semi,definite positive) one
can also initialize the au5iliary matri5 NWoKouM(o , +) .
#ore effectively to solve the QEP 1ith g"roscopic effects one advises in the literature hanging Nthe
Damiltoniens00Ine
00
O preceding linearizations. N4ompanions are the matri5esO
( L
3
)
(
|
K 0
n
C N
_
A
\
|
0
n
K
M 0
n
_
B
)
|
u
\u
=0
2n
(3.2,8)
( L
4
)
(
|
0
n
K
M N

_
A
\
|
M C
0
n
M
_
B
)
|
u
\u
=0
2n
(3.2,B)
the &ci obJective is not to respect a property of symmetry but rather those NDamiltoniennes034
03
O
problem. &f K is singular (resp. M) one uses ( L
4
) (resp. ( L
3
)).
00 stamps s+uare order 2n , A is Mno"n as Damiltonienne (resp. anti,Damiltonienne) if it checMs the relation
(AJ)
T
=AJ
(resp.
(AJ)
T
=AJ
"ith J the antisymmetric matri5 unit
J :=
|
0
n
I
n
I
n
0
n
.
03 Fbe,"ith,say that the solutions are symmetric compared to the a5es reality and imaginary! (\, \ ,\ ,\).
Code_Aster
Version
default
&n the case of a QEP sa"s ;T)palindromiqueO -#ac/61
(K=M
T
et C=C
T
)
one prefers the
linearization
( L
5
)
(
|
K K
CM K
_
A
\
|
M KC
M M

_
B
)
|
u
\u
=0
2n
(3.2,:)
-0808 5tratgies retained in .ode<'ster
=ne thus has a very large variety of choice to adapt the linearization of the )EP to each situation. <or
time )ode-'ster does not propose to the user of parameter maMing it possible to modulate only the
linearization. The aforementioned is fi5ed for a given modal solver!
With MODE_ITER_INV (2nd phase) transition )EP/GEP is carried out $ia the companion
matri5es of (%0) by posing N=I
n
. the linearized system is not symmetric but it is not pre,
necessary to appl" a method of the t"pe po1ers opposite.
(%0)F
(
|
0
n
I
n
K C
_
A
\
|
I
n
0
n
0
n
M
_
B
)
|
u
\u
=0
2n
(3.2,0/)
With MODE_ITER_SIMULT (METHODE='TRI_DIAG' and ` SORENSEN') transition )EP/GEP
is carried out $ia the companion matri5es of (%3) "hile posing N=M. &f the stiffness matri5es
of mass and damping are symmetric real one falls do"n in the perimeter of the standard GEP
(symmetric realities). The methods of %anczos and Sorensen are then accessible. &f K
becomes comple5 or if one of them is asymmetric only &'(# remains in race ("ith )* cf item
according to)Q
(%3)F
(
|
K 0
n
0
n
M
_
A
\
|
C M
M 0
n
_
B
)
|
u
\u
=0
2n
(3.2,00)
Do"ever "hen M is not in#ertible (fact for e5ample of %agranges of blocMing) the inversion
of the diagonal term of A is not assured any more. To mitigate this problem one introduces a
;regulari2ation= of the matri/ M noted M
R
in the diagonal term. The aforementioned has
the property to cancel by multiplication all the components of the Mernel of
M: M
R
u=0 si uKer ( M) . Thus one can define M
R
1
"ho formally checMs the property
M
R
1
M-MM
R
1
-I
n
on the components Ne5cept Mernel of MO handled vectors. Gecause of
particular structure of the dualized matri5 M (cf -Goi/:1 L9.3) this handling amounts
proscribing the components related on %agranges and the locMed ddls ( v
i
2,3
of the
demonstration of the property nX2 -Goi/:1). Khat does not obstruct of anything the process
since one is interested only in the physical modes and not in these artifacts of
mod7lisations09In
09
.
(%3)FF
(
|
K 0
n
0
n
M
R
_
A
\
|
C M
M 0
n
_
B
)
|
u
\u
=0
2n
(3.2,03)
09 proceeded identical is often used to solve the GEP. &t consists in initializing the algorithm of resolution by a
vector of the image group of M (thus filtering the elements of the Mernels). &nstead of the random vector u
i
= one taMes Mu
i
.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : ,/"2
With MODE_ITER_SIMULT (METHODE='QZ')= one preferred to avoid these complications. The
obJective being to pri#ilege the numerical robustness for treating small cases ( 10
3
degrees of freedom). Scenario (%3) "as empirically retained "hile posing N=oI
n
"ith
o:=
1
3n
(K+M+C)
(%3) Y
(
|
K 0
n
0
n
oI
n
_
A
\
|
C M
oI
n
0
n
_
B
)
|
u
\u
=0
2n
(3.2,09)
-0> mplantation in Code_Aster
the course of a +uadratic modal computation is by construction very near to that of a generalized
problem. =ne thus "ill be attached to the functional diagram of resolution of the GEP describes in
-Goi/:1 (cf L 9.B). &ts stages breaM up as follo"s!
-0>01 Preprocessings (lineari2ation$ computation of the shift)
>7termination of the lineari2ed form and the spectral transformation associated according to the
adopted method (po"er %anczos &'(# and )*) and the parameters 'A#USTE'/'PRO$%E' (for
MODE_ITER_INV) and T PLUS_PETITE'/'$ENTRE' (for MODE_ITER_SIMULT).
&t should be noted that the eigen modes being in the comple5 plane the test of Sturm currently
established is inoperative. Thus the heuristics of MODE_ITER_INV is not based on the modal positions
and the option T &ANDEF MODE_ITER_SIMULT is proscribed.
<or the method of subspace (MODE_ITER_SIMULT'MET%ODE= ` TRI_DIAG' and T SORENSENF)
once the linearized problem (%3)FF e5humed one applies a spectral transformation of standard Nshift,
and,invertO (cf -Goi/:1 L9.8/L.). That "ill maMe it possible to complete the transformation in SEP02Sur
02

(S0) to direct the search of the spectrum in an area of interest for the user and to better separate the
eigenvalues.
(S0)
( AcB)
1
_
A
c
B
|
u
\u
_
W
=
1
\c
_
j
|
u
\u
_
W
(3..,0)
the method of the po1ers opposite applies it a spectral transformation particular to the linearized
problem (%0)F.
(s for method Q% (MODE_ITER_SIMULT'MET%ODE= ` QZ') this spectral transformation is
superfluous. The algorithm deals "ith the linearized problem directly (%3) Y and calculates all its modes.
(ccording to the "ishes of user (OPTION NMA(_)REQH) it filters then the results.
+ote,
's 6or t/e te0/niques o6 lineari>ation= no parameter user ma<es it possible 4et to 0/an!e
spe0tral trans6ormation* &nto quadrati0= it 1ould be interestin! to use trans6ormations more
adapted to t/e 0omple@ plane t/an traditional Jt/e s/i6t:and:in$ertK* 9or e@ample = a
trans6ormation o6 t/e )a4le4 t4pe to ma<e 0on$er!e simultaneousl4 t/e 0ouples o6 0omple@:
0onAu!ate ei!en$alues (\, \)
02 "hich apply the conventional modal solvers.
Code_Aster
Version
default
( AcB) B
1
( A
cB) B
1
_
A
c
w=
1
( \c) ( \c)
_
j
W
(2*5:2)
)ette strate!4 o6 )a4le4 spreads to treat t/e !4ros0op4 (06 L*3e/rman and D*.at<ins 200)
and to ma<e 0on$er!e simultaneousl4 t/e quadruplets (\, \ ,\ ,\)
)ertains aut/ors also propose to in$ert t/e p/ase o6 lineari>ation and t/at o6 spe0tral
trans6ormation B3ee0FD*
-0>0- ?actori2ation of d"namic matri/es
4omme one already underlined it these factorizations of dynamic matri5es of the typene Q(\) are not
used to implement a test of Sturm. This last being illicit for the )EP. Do"ever they remain a product
very present and very couteu50.4omple5ity
0.
for!
Estimate the function cost of the heuristic part (method of #$ller,Traub) "ith MODE_ITER_INV
(OPTION='A#USTE').
Khen one must handle a matri5 of "orM comprising of the opposite. To be more effective one
seeMs a formulation then utilizing only
Q(\)
1
(#=>E;&TE';&?@ZFDIRE$TF and
MODE_ITER_SIMULT''TRI_DIAG'/'IRAM').
4omprehensive approach (MODE_ITER_SIMULT''QZ') is not concerned "ith this preliminary
factorization of the dynamic matri5.
-0>04 Modal computation
modal computation itself is carried out, one solves standard problem SEP one returns "ith the
intermediate GEP then "ith the initial )EP. ( each one of these conversions one filters and
transcribes the results of preceding computation. 4oncerning the eigen#alues (cf L3.0/3.3) it is not
retained that \ "ith positive imaginary part of the coupled modes (\, \).
yo*r +ro,-e. /0 01ro"2-y d!.+ed3
4!-*e 5S6 7-e!" 5S6 re!- 5S6 8 9
4!-*e 5S6 7-e!" 5S6 7o.+-e: 5S6 w/1; 7o.,/"ed8 <=>
4!-*e 5S6 7-e!" 5S6 7o.+-e: 5S6 w/1;o*1 7o.,/"ed8 =
E@ample * Printin!s in t/e 6ile alarm messa!e re0apitulatin!
t/e number o6 modes not sele0ted (/ere 2 realities)* E@tra0t o6 t/e sdll2"a ben0/mar<*
<or the eigen#ectors t"o possibilities remain open!
>irectly taMe n the first components of w (part Mno"n as NhighO)
4hoisir n last (left Mno"n as Nlo"O) possibly divided by the same scalar.
&n )ode-'ster it is the second option "hich "as retained. This choice is not al"ays anodin06%a
06
in
particular "ith respect to the +uality of the modes and their sensitivities to the round,off errors.

&n MODE_ITER_INV only one method is available an alternative of the method of the inverse iterations
due to Aennings (?DIRE$T `). &t refines the eigenvalues detected beforehand by the method of #$ller,
Traub (FA#USTE') or estimates provided by the user (?PRO$%E `). (s regards MODE_ITER_SIMULT
it allo"s the use of three distinct methods! method of %anczos (?TRI_DIAGK) that of Sorensen
(?SORENSEN@) and )* (NQZF). =nly the t"o last are available "ith real or comple5 matri5es asymmetric
symmetric (for K only).

Remarques
0. computation enavecla (!n" ) ! band"idth eta n cuts problem.
06 alternative of method )* suggested by <.Tisseur -T#/01 is based on the values of Nthe opposite errorO of
each mode to choose the high or lo" part eigenvectors.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : +/"2
)/a0une o6 t/ese met/ods /as internal tests o6 stops* 8ot 0ountin! t/e met/ods o6 proAe0tion
emplo4 au@iliar4 modal met/ods: QR/ QL 6or 5an0>os and &R'3* T/e4 require also tests o6
stops* T/e user o6ten /as a00ess to t/ese parameters= alt/ou!/ it is 1arml4 re0ommended=
at least initiall4= to preser$e t/eir $alues b4 de6ault*
)ontrar4 to t/e 7EP= it is not 6or0ed M: ort/onormali>ation o6 t/e ei!en$e0tors* &t does not
/a$e an4 meanin! in QEP* 3oreo$er= b4 appl4in! t/e result o6 proposal 2 o6 B%oi0CD to t/e
lineari>ed problem= it is 0lear t/at t/e ei!en$e0tors are A and B : ort/o!onal* %ut be0ause
o6 0omple@it4 o6 t/e linear redu0tions used= t/at does not lead (e@0ept t4pi0al 0ase) to
ei!en$e0tors K = M or C : ort/o!onalM
-0>08 Postprocessings of chec*ing
4ette left last gathers the only postprocessing "hich checMs the good progress of computation (in the
absence of test of Sturm adapted to the comple5 case). =ne computes the relati#e error on the
hermitian
1@
residue of the initial QEP

u=
u
j u[
Si \>SEUIL_)REQ alors
\
2
Mu+\Cu+Ku
2
Ku
2
[SEUILA
Sinon
\
2
Mu+\Cu+Ku
2
[SEUILA
<in si.

'l!orit/me * Test o6 t/e norm o6 t/e residue*

This se+uence is parameterized by Mey "ords SEUIL and SEUIL_)REQ belonging respectively to the
Mey "ords factors VERI_MODE and $AL$_)REQ. &n addition this post , processing is activated by
initialization "ith NOUIO (default value) of STOP_ERREUR in the Mey "ord factor VERI_MODE. Khen this
rule is activated and non,observance computation stops if not the error is Just announced by an alarm.
=ne could of course only too much recommend not deactivate this parameter inJusticeQ
-0>0> :ispla" in the file :ans
message the file message are mentioned the relative informations "ith the modes selected. <or
e5ample in the case of a )EP one specifies the modal solver used and lists it eigenvalues \
i

retained by order ascending of imaginary part
&m(\
i
)
2n
(column )REQUEN$Y). Then one specifies his
damping (
i
=
'e(\
i
)
\
i
and his error norm (cf algorithm nX0).
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
BB
$OMPUTATION MODAL8 MET%ODE GLO&ALE O) TYPE QR
ALGORIT%ME QZ_EQUI
NUMERO FREQUENCY (HZ) DAMPING Error nor
< <39CD<EE'=9 <3EEF=GEB=H D3DCFHFEB=9
9 <39GEGFE'=9 BC3>F>>9EB<= <3H<HEGEB=<
C G3D>=CCE'=9 BE3HHD9>EB<= <3G<=GCEB=C
G G3DDE>EE'=9 <3G<C<EEB<9 93<GG=<EB=C
E <3<<EC<E'=C G3>E=>EEB<9 <3<>FFDEB=G
08 norme08?orme and only on the components of the physical ddls.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : F/"2
33333
E@emple 2* Printin!s in t/e 6ile messa!e o6 t/e ei!en$alues ; retained at t/e time o6 QEP*
E@tra0t o6 t/e sdll2"a ben0/mar<*
?o" that the conte5t of the )EP in )ode-'ster "as brushed "e "ill be interested more particularly in
the methods of type po"er and their establishment in operator MODE_ITER_INV.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : G/"2
4 Method of the po1ers opposite (MODE_ITER_INV)
401 ntroduction
4omme for the processing of the GEP in )EP this operator functions in t"o parts!
9ocali2ation of the eigen#alues. =ne determines an appro5imation of each eigenvalue
contained in an interval given by the algorithm of MAller)Traub -#ul.61 ->G/B1 or one
taMes an estimate provided by the user.
mpro#ement of these estimates and the computation of their eigenvectors associated
by an opposite iteration method (alternative of Aennings -Aen881).
The search for a value approached for each eigenvalue considered is selected in the Mey "ord factor
$AL$_)REQ $ia Mey "ord OPTION!
&f OPTION='A#USTE@ in each interval of fre+uencies defined by Mey "ord )REQ an appro5imate
value of each eigenvalue contained in this interval is calculated by using the method of #$ller,
Traub (cf L9.3).
Either one retains only 1;e NMA(_)REQ the lo"est fre+uencies contained in the ma5imum interval
specified by the user or one calculates all the values of this interval (if NMA(_)REQ==).
&f OPTION='PRO$%E@ the fre+uencies given by Mey "ord )REQ are regarded as the appro5imate
values of the sought eigenvalues.
+ote,
#6 0ourse= as one alread4 spe0i6ied= t/is operator is to be used onl4 to determine or
re6ine some ei!en$alues* 9or a 1ider sear0/ it is ne0essar4 to use operator
MODE_ITER_SIMULT*
.it/ option JPROCHEK one 0annot 0ompute o6 multiple modes*
&t is an e@pensi$e al!orit/m be0ause it 0alls mu0/ upon 6a0tori>ations o6 a d4nami0 matri@
o6 1or< Q(\) .
40- Mthode de MAller)Traub
4omme in )EP the astute test of Sturm cannot apply more the heuristics of localization of the
eigenvalues must be based on another strategy. =ne Nfolds bacM oneselfO then on the con#entional
search of the 2eros of the characteristic pol"nomial associated "ith the )EP p(\)=d7t Q(\) in
the comple5 plane.
(s one then does not lay out any more a relation of order it is not possible to apply the dichotomy bets
in "orM for the GEP. ( generalization at three points of the secant method maMes it possible ho"ever
to be left there. &t is the method suggested by >.E.#uller -#ul.61 ->G/B1 in 0:.6. &t is an iterative
method using as curve of interpolation a parabola "ith horizontal a5is. Khereas the secant method
lean on a linear interpolation bet"een the t"o reiterated last
(\
k1
, p(\
k1
)) ,(\
k
, p(\
k
))
, the
method Mno"n as of N#$ller,TraubO seeMs to build the interpolated +uadratic one passing by the three
last
(\
k2
, p(\
k 2
)) ,(\
k1
, p(\
k 1
)) ,(\
k
, p(\
k
))
.
Gy "riting that the interpolated +uadratic one of %agrange of the characteristic polynomial
p(\)-#
0
\
2
+#
1
\+#
2
(9.3,0)
must pass by the last three +uoted points one builds a system of three e+uations to three unMno"n
factors. =f his analytical resolution one deducts the root nearest of the reiterated last
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : C/"2

j
k+1
E
2p(\
k
)6
k
$
k
!
.
$
k
2
4p(\
k
) 6
k
j
k
|
p(\
k2
) j
k
p(\
k1
)6
k
+p(\
k
)
avec $
k
%=p(\
k 2
)j
k
2
p(\
k1
) 6
i
2
+p(\
k
)(j
k
+6
k
)
j
k
%=
\
k
\
k 1
\
k 1
\
k2
(9.3,3)
To j
k
one deducts the ne" one easily then reiterated \
k +1
. The sign of the denominator is selected
so as to minimize j
k+1
thus one privileges the NconservativeO choice of the zero nearest to
reiterated preceding \
k
. &t is considered that the method converged "hen the follo"ing relative
criterion "as reached ( k+1!4!"1NMA(_ITER_A#USTE iterations)

\
k +1
\
k
\
k
e
PRE$_A#USTE
(9.3,9)
4ette method is relatively easy to implement but it lends itself badly in the searches of zeros of real
functions "ith real roots because it plunges the interpolation in the comple5 plane and this even on the
basis of actual values. ts interest is related to the class of this method called ;b" cur#es of
interpolation=$ namely!
The safety of the method of bisection since search is carried out in a ball of appro5im7sse
(\
k
)
k
reducing
gradually
Seul the computation of the function is necessary (computation step of derived such as for e5ample in the
method of ?e"ton,'aphson).
4onvergence is connected "ith a +uadratic convergence (qN*GC).

&n practice the rating is done not directly on the determinant of the characteristic polynomial
p(\):=d7t Q(\) but on its ;dflat= to ta*e account of alread" e/humed spectral information
(if not one reconverge al"ays to"ards the same mode). &n addition after having computed k
eigenvalues (\
i
)
i =1
k
one dflate also b" ta*ing account of their con6ugu1B.
0B
not to recompute
them

p(\):=
d7t Q(\)
]
i=1
k
(\\
i
)(\
\
i
)
(9.3,2)
the rating of the denominator is commonplace. That of the numerator d7t Q(\) is carried out in
factorisant0:=n
0:
in form
L&L
T
the dynamic matri5 Q(\) and by carrying out the product of the
diagonal terms of the diagonal matri5 D .
This factorization of dynamic matri5 is very e5pensive "ith a computation comple5ity in (!n" )
"here ! is the band"idth and n the size of the problem. &t is the part rebuMes it in capacity for
treatment and place memory of the algorithm. &t is to be reproduced p(i+2) time "ith p the
number of desired modes and i the average iteration count to convergence. The algorithm is thus
rather to reser#e for the QEP small si2e (C1D8 degrees of freedom) or for the benchmar*s of
methods0
+ote,
3Oller B3ul5+D proposes a parti0ular and e66e0ti$e pro0edure to initiali>e t/e pro0ess i6 t/e 6un0tion to
be interpolated p(\) is a pol4nomial o6 order n 1/ose 0oe66i0ients are <no1n* T/e 0ase 1/i0/
0B Fis as for this reason as the perimeter of use of MODE_ITER_INV is restricted to the standard )EP
(symmetric reality). =ne e5pects to find only comple5,conJugate eigenvalues per pair.
0: e5pects to be able to factorize "ithout ties up ("ithout having recourse to the s"ivelling) and to handle one
factorized symmetric. &t is another reason "hich limits the perimeter of MODE_ITER_INV to the real
symmetric )EP.
Code_Aster
Version
default
interests us does not re:enter un6ortunatel4 in t/is 0lass o6 problem* T/e initiali>ation o6 t/e al!orit/m
t/us requires 2 preliminar4 ratin!s o6 p.
)ette met/od does not 0ompute a modal position= it t/us mana!es badl4 t/e multipli0ities* )ontrar4
to t/e di0/otom4 bets in 1or< 6or t/e 7EP* T/e 0on0ept o6 t/res/old in on t/is side 1/i0/ t1o di!ital
assets are supposed to be multiple is related to t/e parameter e
PRE$_A#USTE
#ne does not retain in t/e 6ormula ("*2:2) onl4 t/e 0omple@ 1it/ positi$e ima!inar4 part*
404 Method of the po1ers opposite (alternati#e of Eennings)
the second part consists in refining the estimates of the eigenvalues computed by the method of
#$ller,Traub and "ith compute their eigenvectors associated. <or this maMing one lineari2es the
QEP according to strateg"
(9 1) ; (cf F-08) and one applies a particular spectral transformation due to Eennings GEen@@H
(1I@@)0 &ts obJective is to reveal liMe reverse of matri5 only that of the dynamic matri5
Q(\)
1
. The
algorithm set up in the code cuts out as follo"s!
&nitialization of the eigenvalue starting from the estimate of the first phase!
\
0
.
4onstruction of the dynamic matri5
Q(\
0
)
and its factorization.
&nitialization of the iterative process by the vectors!
x
0
al7atoire y
0
=\
0
x
0
.
k=0, NMA(_ITERB< To maMe
?ormaliser
x
k
-
x
k
(x
k
)
t
Mx
k
, y
k
-
y
k
( y
k
)
t
My
k
'7soudre
Q(\
0
) x
k+1
=Cx
k
+\
0
Mx
k 1
+My
k 1
4ompute
y
k+1
=\
0
x
k+1
+x
k

Evaluer
\
k
=
( x
k
)
T
Cx
k
+
.
( ( x
k
)
T
Cx
k
)
2
4(( x
k
)
T
Mx
k
) (( x
k
)
T
Kx
k
)
2( ( x
k
)
T
Mx
k
)
(9.9,0)
&f
\
k+1
\
k
\
k
PRE$ and
ma5('e(\
k
\
0
),&m(\
k
\
0
))PRE$
then (9.9,3)
the solution eigen mode is
(\
k
, x
k
)
e5it.
'l!orit/m 2* 3et/od o6 t/e po1ers opposite (alternati$e o6 Pennin!s)*
The stopping criteria PRE$ and the ma5imum number of authorized iterations NMA(_ITER are arguments of the
Mey "ord factor $AL$_MODE .
+ote,
T/e stoppin! 0riteria are based on t/e e@tension o6 t/e quotient o6 Ra4lei!/ (06 B%oi0CD
Q,*") to t/e QEP* Eno1in! an ei!en$e0tor x
k
a !ood estimate o6 its ei!en$alue \
k
is
pro$ided b4 t/e 6ormula ("*":)* T/e al!orit/m is stopped as soon as relati$e $ariations (in
0omple@) and absolute (on t/e parts real and ima!inar4 separatel4)= 0ompared to estimated
initial= are lo1er t/an a 0ertain $alue* T/us Aointl4= one re6ines estimated initial o6 t/e
ei!en$alue and one determines /is asso0iated ei!en$e0tor*
&n spite o6 t/e lineari>ation o6 t/e initial problem= t/e JastuteK 6ormulation o6 Pennin!s /andles
onl4 entities o6 si>e n * '0tuall4= al!orit/m 2 0an be s0/emati>ed in t/e $e0torial 6orm
|
Q(\
0
) 0
n
\
0
I
n
I
n
x
k +1
y
k +1
=
|
C\
0
M M
I
n
0
n

x
k
y
k
("*":")
408 Primtre of use
Code_Aster
Version
default
)EP to symmetric real matri5es.
The user can specify only TYPE_RESU='DYNAMI$S' liMe membership of its computation classifies (not
of bucMling). =ne then informs possibly vector )REQ (and not $%AR_$RIT6.
40> :ispla" in the file :ans
message the file message the results are displayed in the form of table
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB
LE NOM!RE OF D"O"F"
TOTAL IS8 EF
O) LAGRANGE IS8 C9
LE NOM&RE O) D3O3)3 $REDITS IS8 H
$OMPUTATION MODAL8 OPPOSITE ITERATION METHOD
MULLER INVERSE
NUMERO )REQUEN$Y 5%Z6 DAMPING N&_ITER PRE$ISION N&_ITER PRE$ISION Error "or.
< E3E9D<EE'== <3E9=D=EB=9 E D3GDE99EB=> < G3G>CECEB<> 93<>>GHEB<E
9 <3=HDEDE'=< 93H>E>EEB=9 C <3<>DDCEB=E < C39G9=CEB<> G3HCED>EB<E
C <3ED9>=E'=< C3DEFGEEB=9 E 93EC<>=EB=E < H3HFHGGEB<H >3<9G<GEB<F
I
VERI)I$ATION A POSTERIORI O) T%E MODES
E@ample "* Tra0e MODE_ITER_INV (QEP) in t/e 6ile messa!e*
E@tra0t o6 t/e sdld2Fb ben0/mar<*
<or each eigenvalue (represented in form )REQUEN$E=
&m(\
i
)
2n
and AMORTISSEMENT=
'e(\
i
)
\
i
cf
L3..) one traces the iteration count and the accuracy obtenue3/Pr7cision
3/
of the t"o phases of the
modal operator. Kith option ?PRO$%E@ the columns concerning the method of #$ller do not appear
obviously. The last column Error "or. taMe again the error norm of the determined residue
follo"ing the algorithm nX0 (L3..).
40J 5ummar" of the Rcapitulons
parameter setting maintaining the parameter setting of operator MODE_ITER_INV.
Operand Word-key Valeur by
default
Rfren!es
TYPE_RESU='?DYNAMI$ @ DYNAMI$S@
L3.0
CALC_FREQ
FREQ (if PRO$%E ) L9.0
OPTION = ` A#USTE' JC3<
?AD#USTS
O
?NEAR'
L9.0
NMA#_FREQ =
L9.0
NMA(_ITER_A#USTE
0. L9.3
PRE$_A#USTE
0.E,/2 L9.3
NMA(_ITER_S%I)T
. -Goi/:1 L9.6
PRE$_S%I)T
/./. -Goi/:1 L9.6
SEUIL_)REQ
0.E,/3 -Goi/:1 L9.:
3/ of the method of #$ller "ithin the meaning of the formula (9.3,9) that of the method of Aennings taMes again
the formula (9.9,3).
Code_Aster
Version
default
Operand Word-key Valeur by
default
Rfren!es
CALC_MODE OPTION= ` DIRE$T' ?DIRE$T@
L9.9
?RAYLEIG%' (even processing) L9.9
PRE$
0.E,/. L9.9
NMA(_ITER
9/ L9.9
VERI_MODE STOP_ERREUR='OUI@
O OUI O -Goi/:1 L9.:
?NON@
SEUIL
0.E,/3 -Goi/:1 L9.:
Tableau "*+:* ;ummar4 o6 t/e parameter settin! o6 MODE_ITER_INV (QEP)*
+ote,
#ne 6inds all t/e JtripailleK o6 parameters related to postpro0essin!s o6 0/e0<in! (SEUIL_FREQ,
VERI_MODE)*
't t/e time o6 t/e 6irst transitions= it is stron!l4 ad$ised to modi64 onl4 t/e main parameters noted in
6at* T/e ot/ers relate to more t/e m4steries o6 t/e al!orit/m and t/e4 1ere initiali>ed empiri0all4 1it/
$alues standards*
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2"/"2
8 Method of subspace (MET%ODE='TRI_DIAG'/'SORENSEN')
801 QEP 1ith the 5EP
80101 Passage QEP!7EP, lineari2ation
4omme one e5plained it to the L3.2 the transition of the )EP "ith the GEP is carried out $ia the
follo"ing linearization
(%3)FF
(
|
K 0
n
0
n
M
R
_
A
\
|
C M
M 0
n
_
B
)
|
u
\u
=0
2n
(2.0,0)
The GEP obtained is structurally symmetric reality and inherits the properties of the matri5es K M
and C . (s soon as one of them is asymmetric or comple5 (possible only "ith K ) the GEP becomes
asymmetric or comple5. The symmetric aspect or not of the GEP is not in fact not locMing because
each method 1ill get bus" to find the couple ;operator of 1or*!scalar product= 1hich enables
him to function . #oreover only %anczos needs a symmetric couple. #ethod &'(# can it function
very "ell into asymmetric and "ith often more robustesse30(u
30
.
8010- Passage 7EP!5EP, spectral transformation
Puis a spectral transformation (cf -Goi/:1 L9.8/L.) maMes it possible to complete the phase of
preprocessing of the )EP by transforming GEP (%3)FF the preceding one in a SEP. Khen comple5
modes are handled t"o cases are possible!
KorM completely in arithmetic comple/
'ester generally into arithmetic real by isolating the contributions real and imaginary from the
conventional spectral transformation.
The first strateg" classically uses the spectral transformation Mno"n as of Nshift,and,invertO and
metamorphose (%3)FF in
(S0)
( AcB)
1
B
_
A
c
w=jw
avec j:=
1
\c
, w:=
|
u
\u
(2.0,3)
Elle is implemented by activating the comple5 approach of &'(# (T
SORENSEN''APPRO$%E='$OMPLE(E'). &t is the only alternative "hen one handles a matri5 K
comple5e33>Cs
33
. &t is usable "ith K, M and C symmetric or not.
The second strateg" rests on the spectral transformation "ith Ndouble shifts addsO introduced in 0:B8
by G.?.Parlett V R.Saad -PSB81 "hich results in handling t"o types of SEP
(S3)
'e( ( AcB)
1
B)
_
A
c
K
w=j
Z
w
avec j
Z
:=
1
2
(
1
\c
+
1
\ c
)
, w:=
|
u
\u
(2.0,9)
30 price ho"ever of a surplus of computations and storages
33 "hich K is comple5 symmetric and "hich one chose &'(# some is the approach chosen in the command
file it is approach N$OMPLE(EF "ho is taMen by default
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2,/"2
(S9)
&m( ( Ac B)
1
B)
_
A
c
)
w=j
,
w
avec j
,
:=
1
2i
(
1
\c
+
1
\
c
)
, w:=
|
u
\u
(2.0,2)
4es t"o alternatives are implemented "ith %anczos and &'(# $ia the values respectively NREELF and
NIMAGF Mey "ord APPROA$%ES . Kith %anczos the perimeter of use is restricted "ith the conventional
)EP (symmetric realities) "hile &'(# is less restricted and allo"s also the asymmetric one.
+ote,
T/e ori!in o6 double denomination t/e Js/i6ts addsK spe0tral trans6ormation abo$e appears
more 0learl4 besides i6 one re6ormulates t/e operators
A
c
Z
:=
1
2
| ( Ac B)
1
+(A
cB)
1
B
A
c
,
:=
1
2i
| (AcB)
1
+( A c B)
1
B
as 6ollo1s (,*:5
) t/e terminolo!4 JsumK in opposition to t/e Jdouble s/i6ts produ0edK is initiall4 proposed b4
P*)*9ran0is and is used= in 1ritin! pad= b4 met/od QR and t/e Jimpli0itK restartin!s o6 &R'3
(06 B%oi0CD 'nne@e ):
A
c
:=| (AcB)+(A
cB)
1
B
(,*:+)
T/e a6orementioned /as t/e maAor dra1ba0< to produ0e matri@es o6 1or< $er4 6illed (t/us
more e@pensi$e to /andle and store) 0ompared to t/e strate!4 o6 Parlett S ;aad*
&nce determined the operator of 1or*$ it remains to choose its associated scalar product. <or
&'(# one can be satisfied "ith a couple Noperator/asymmetric scalar productO (cf -Goi/:1 L6) but for
%anczos the aforementioned must obligatorily be symmetric (cf -Goi/:1 L8). Several choices of
(pseudonym) matric produce,scalars allo" this symmetry!
( w , z)
B
:=z
T
Bw
( w , z)
Z
:=z
T
'e| (AcB)
1
1
w
( w , z)
,
:=z
T
&m| ( Ac B)
1
1
w
(2.0,8)
The first functions "ith the t"o formulations (S3) and (S9) "hile the second (resp. the third) maMes
symmetric only A
c
Z
(resp. A
c
,
). &n the effective establishment in )ode-'ster these are the t"o last
"hich are retained for the approaches real and imaginary of %anczos.
+ote,
T/ese s0alar produ0ts are t/e JnaturalK e@tensions o6 (pseudon4m) t/e matri0 s0alar produ0t
used b4 t/e alternati$e o6 8e1mann:Pipano in 7EP:
( w, z) :=z
T
(AcB) w
(,*:G)
80- Establishment in Code_Aster
80-01 .hoi/ of the spectral offset
&n GEP it there are four "ays of choosing this shift (cf -Goi/:1 L..2). &n )EP option N&ANDEF being
proscribed because of absence of test of adapted Sturm this figure is tiny room to three!
c=0 , one seeMs the smallest eigenvalues of the starting problem. This corresponds to
OPTION='PLUS_PETITE@ under the Mey "ord factor $AL$_)REQ.
c=c
0
avecc
0
=(2n '
0
)
2
, one seeMs the fre+uencies close to fre+uency )REQ= '
0

(OPTION='$ENTRE@).
Code_Aster
Version
default
c=c
0
avec c
0
=(2n '
0
)
2
et c
1
=j( 2n '
0
)
2
/ 2 one seeMs the fre+uencies close to fre+uency
)REQ= '
0
(OPTION='$ENTRE@) and of damping reduces AMOR_REDUIT=
j
(
OPTION='$ENTRE@).
The number of fre+uencies to calculating is given in general by the user using NMA(_)REQ under the
Mey "ord factor $AL$_)REQ.
80-0- .omputation of the operator and the scalar product of 1or*
=ne recapitulates in the table according to all the couples (operator of "orM scalar product) possible
according to the selected items by the user.
APPROA$%ES/MET%ODE
T TRI_DIAG'
` SORENSEN'
(by defect)
T $OMPLE(E' &nalienable
( A
c
, L
2
)

` REEL'
( b" defect)
( A
c
Z
,( )
Z
)
( A
c
Z
, L
2
)
?IMAG'
( A
c
,
,( )
,
)
( A
c
,
, L
2
)

Table ,*2:* To!et/er 0ouples (operator o6 1or<= s0alar produ0t) possible
a00ordin! to t/e sele0ted items b4 t/e user*
The computation of the operators of 1or*
A
c
!
can be brought bac* to simple products matri/)
#ector and 1ith an in#ersion of the d"namic matri/ Q(\) (factorized beforehand) $ia the
formulation (astute) follo"ing
( AcB)
1
B=
|
0
n
0
n
M
R
1
M 0
n
|
Q(c)
1
0
n
0
n
cM
R
1
MQ(c)
1
|
C+cM M
C+cM M
(2.3,0)
>Fautre part this formulation has the Ngood tasteO to allo" processing into pure arithmetic real and to
preserve hollo" structure of the matri5es. =ne can thus build the follo"ing procedure!
Preparation dans394ar C
39
(only once in phase of initialization of the algorithm cf
L 3..)!
To form
Q(c):=( c
2
M+cC+K)
formula Q(c) forms 9:9T.
4omputation of
A
c
!
|
u
v
_
w
(several times by iteration of %anczos or &'(#)!
<orm in R u
1
:=Cu, u
2
:=Mu , u
3
:=Mv ,
4ompute in C u
4
:=Q(c)
1
+cu
2
+u
3

Suivant the choice of the approach
A
c
K
w=
|
'e( u
4
)
M
R
1
M(u'e(cu
4
))
A
c
,
w=
|
&m(u
4
)
M
R
1
M(u&m(cu
4
))
'l!orit/me "* Pro0edure 6or 0ompute operators o6 1or<

A
c
!
*
&n comple5 approach computation is done directly $ia the formula (2.0,3) in arithmetic comple5.
39 the shift (thus +ueavec K &'(#) can be comple5.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2+/"2
4oncerning the matric scalar products their handling in )ode-'ster lean on the follo"ing formulations!
( w , z)
Z
:=z
T
| ( A'e(c) B)+&m
2
(c) B( A'e(c) B)
1
B w
( w , z)
,
:=z
T
|
1
&m(c)
( A'e(c) B) B
1
(A'e(c) B)+&m
2
(c)B
w
(2.3,3)
+ote,
The computation of the matric scalar products can be carried out only into arithmetic real. <or
the first scalar product one needs an additional dynamic matri5 Q('e(c)) and for its
factorized (from "here a overcost computation and memory).
804 Perimeter of use
QEP to real s"mmetric matri/es for %anczos possibl" as"mmetric (and K can be symmetric
comple5) for &'(#.
808 :ispla" in the file :ans
message the file message the results are displayed in the form of table
LE NOM!RE OF D"O"F"
TOTAL IS8 <C=
O) LAGRANGE IS8 <F
LE NOM&RE O) D3O3)3 $REDITS IS8 <=F
$OMPUTATION MODAL8 MET%ODE OK ITERATION SIMULTANEE
METHODE OF SORENSEN
NUMERO )REQUEN$Y 5%Z6 DAMPING Error "or.
< <39G<FCE'=9 B<3HD99DEB=9 <3<FEE=EB=D
9 <39G<FGE'=9 <3HD99DEB=9 <3=GHH9EB=D
I
F <3=>C9<E'=C <3FCGDEEB=< <3CF=D9EB<C
Error "or. MOYENNE8 =3CFDG>EB=D
E@emple ,* Tra0e MODE_ITER_SIMULT 1it/ METHODE= ` SORENSEN' (QEP)
in t/e 6ile messa!e* E@tra0t o6 t/e sdll2"b ben0/mar<*
<or each eigenvalue (represented in form )REQUEN$E=
&m(\
i
)
2n
and AMORTISSEMENT=
'e(\
i
)
\
i
cf
L3..) one traces the error norm of the determined residue follo"ing the algorithm nX0 (L3..).
80> 5ummar" of the Rcapitulons
parameter setting maintaining the parameter setting of operator MODE_ITER_SIMULT for the methods
of %anczos and Sorensen.
&perand (ord)*e" Laleur b"
Rfrences
defect
TYPE_RESU ='?DYNAMI$ @ DYNAMI$S@
L3.0
METHODE = ` TRI_DIAG' ` SORENSEN'
-Goi/:1 L6
` SORENSEN'
-Goi/:1 L8
OPTION= ` MODE_RIGIDE'
?onavailable
CALC_FREQ
FREQ (if $ENTRE ) L2.3
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2F/"2
&perand (ord)*e" Laleur b"
Rfrences
defect
AMOR_REDUIT (if $ENTRE ) L2.3
APPROCHE$ 'REEL' 'REEL'
L2.0
` IMAG'
L2.0
( if SORENSEN ) ` $OMPLE(E' L2.0
OPTION = ` PLUS_PETITE' `
PLUS_PETITE'
L2.3
` $ENTRE'
L2.3
NMA#_FREQ
0/ L2.3
DIM_SOUS_ESPACE
COEF_DIM_ESPACE
4alculated -Goi/:1 L6/8
I3
Isual parameter setting of
?TRI_DIAG'/'SORENSEN'
-Goi/:1 L6/8
Table ,*5:* ;ummar4 o6 t/e parameter settin! o6 MODE_ITER_SIMULT (QEP) 1it/ METHODE= `
TRI_DIAG'/'SORENSEN'.
+ote,
't t/e time o6 t/e 6irst transitions= it is stron!l4 ad$ised to modi64 onl4 t/e main parameters
noted in 6at* T/e ot/ers relate to more t/e m4steries o6 t/e al!orit/m and t/e4 1ere initiali>ed
empiri0all4 1it/ $alues standards*
&n parti0ular= to impro$e qualit4 o6 a mode= t/e 6undamental parameter is t/e dimension o6 t/e
subspa0e o6 proAe0tion o6 t/e ;EP= DIM_SOUS_ESPACE*
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2G/"2
> Total method Q% (MET%ODE='QZ')
>01 QEP 1ith the 7EP
4ontrairement "ith the methods seen previously method )* is able to manage a GEP directly. =ne
thus has that onl" one transformation to be applied to the initial QEP$ it is the lineari2ation . That
empirically retained and detailed "ith the L 3.2 is
(%3) Y
(
|
K 0
n
0
n
oI
n
_
A
\
|
C M
oI
n
0
n
_
B
)
|
u
\u
=0
2n
(..0,0)
the GEP obtained is not structurally symmetric (or hermitian) but it is not preJudicial "ith computation
because the drivers of adapted %(P(4U "orM only into asymmetric. ?or more robustness and to
simplif" the structuring of the code one formulates and solves GEP (%3) Y in the comple/ plane.
(s for the GEP "ith comple5 modes one uses the standard routines %(P(4U (ZGGEV) or e5pert
(ZGGEV() according to parameter TYPE_QZ='QZ_SIMPLE'/'QZ_EQUI'.
To resulting from modal computation )* returns to )ode-'ster the calculated modes and the latter
"ill be checMed filtered and ordered according to the same recommendations as for the comple5
modes of the GEP (cf -Goi/:1 L:.2).
>0- Perimeter of use
QEP to s"mmetric matri/es or not (and K can be symmetric comple5).
>04 Printings in the file message
an e5tract "ith accompanying notes of the sdll009a benchmarM is taMen again "ith the L3...
>08 5ummar" of the Rcapitulons
parameter setting maintaining the parameter setting of operator MODE_ITER_SIMULT for method )*.
&perand (ord)*e" Laleur b" default Rfrences
TYPE_RESU='?DYNAMI$ @ DYNAMI$S@
L3.0
METHODE = ` QZ' ` SORENSEN'
-Goi/:1 L:
OPTION= ` MODE_RIGIDE'
?onavailable
CALC_FREQ
FREQ (if $ENTRE ) -Goi/:1 L:.2
AMOR_REDUIT (if $ENTRE ) -Goi/:1 L:.2
APPRO$%E=I
Kithout obJect
OPTION = ` PLUS_PETITE' `
PLUS_PETITE'
-Goi/:1 L:.2
'$ENTRE'
?TOUT@
-Goi/:1 L:.2
NMA#_FREQ
0/ -Goi/:1 L:.2
I3
Isual parameter setting of `
QZ'
-Goi/:1 L:
Table 5*,:* ;ummar4 o6 t/e parameter settin! o6 MODE_ITER_SIMULT (QEP)
1it/ METHODE= ` QZ'.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : 2C/"2
+ote,
't t/e time o6 t/e 6irst transitions= it is stron!l4 ad$ised to modi64 onl4 t/e main parameters
noted in 6at* T/e ot/ers relate to more t/e m4steries o6 t/e al!orit/m and t/e4 1ere initiali>ed
empiri0all4 1it/ $alues standards.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : "0/"2
J Mibliograph"
J01 Moo*s!articles!proceedings!thesesN
->G/B1 G.>ahl+uist V (.GJorcM. 8umeri0al met/ods in s0ienti6i0 0omputin!. S&(# (3//B).
-G%'B31 &.Gohberg P.%ancaster and %.'odman. 3atri@ pol4nomials. E>. (cademic 4lose (0:B3).
-Aen881 (.Aennings. 3atri@ 0omputation 6or en!ineers and s0ientists . E>. Kisley (0:88).
-%TB.1 P.%ancaster and #.TsimenetsMy. T/e t/eor4 o6 matri@es . E>. (cademic 4lose (0:B.).
-#ac/61 >.S.#acMey. ;tru0tured lineari>ations 6or matri@ pol4nomials. Thesis of Iniversit7 of #anchester (3//6).
-#ee/81 U.#eerbergen. T/e quadrati0 'rnoldi met/od 6or t/e solution o6 t/e QEP. &nternal report of Iniversit7 de %euven
(3//8).
-#ul.61 >.E.#$ller. ' met/od 6or sol$in! al!ebrai0 equations usin! 4ear automati0 0omputer . #aths. . Kash. 0/ pp3/B,30.
(0:.6).
-PSB81 G.?.Parlett V R.Saad. )omple@ s/i6t and in$ert strate!ies 6or real matri@es . %inear "ill algebra and its applications
BB,B: pp.8.,.:. (0:B8).
-T#/01 <.Tissor V U.#eerbergen. T/e quadrati0s ei!en$alue problem . S&(# revie" vol. 29 nX3 pp39.,3B6 (3//0).
J0- Reports!account)returned E:?
-Geg/61 #.Gegon. Establis/ment o6 modal sol$ers in )ode-'ster. 'eport of #aster degree of the &?ST? (3//6).
-G)//1 =.Goiteau V G.)uinnez. ;pe0tral met/od o6 anal4sis in )ode-'ster . GooMlet of 4ours of dynamics available onsite
internet http!//""".code,aster.org (3///).
-Goi/B1 =.Goiteau. 7eneral in6ormation on t/e dire0t linear sol$ers and use o6 produ0t 3(3P;. >ocumentation of reference
)ode-'ster '6./3./9 (3//B).
-Goi/Bb1 =.Goiteau. T &nte!ration o6 a modal sol$er o6 t4pe QR in )ode-'sterT and T E@tension o6 sol$ers QR and ;orensen
1it/ t/e as4mmetri0 modal problems o6 )ode-'sterT. (ccount,returned internal E>< ' V > 4',&39/3//B//9/ and 4',
&39/3//B//22 (3//B).
-Goi/:1 =.Goiteau. 3odal sol$ers and problem resolution !enerali>ed (7EP). >ocumentation of reference )ode-'ster
'../0./0 (3//:).
-Goi/:b1 =.Goiteau. 7eneral in6ormation on t/e 0onAu!ate !radient: P)7 'ster and use o6 t/e PET;0 produ0t. >ocumentation
of reference )ode-'ster '6./0./3 (3//:).
-%ev:61 A.'.%eves+ue. 3odeli>ation o6 dampin! in linear d4nami0s. >ocumentation of reference )ode-'ster '../../2
(0::6).
J04 Resources internet
-(rp1 Site Keb of ('P(4U! http!//""".caam.rice.edu/soft"are/('P(4U/ .
Code_Aster
Version
default
@ :escription of the #ersions of the document
Lersion
'ster
'uteur (5)
&rganisme (5)
:escription of the amendments
9 9>.SE%&G#(??,'V>/##? initial Te5te
H H
. =.G=&TE(I E><,'V>/#?
@B.2 =.G=&TE(I E><,'V>/S&?ET&4S
=.?&4=%(S E><,'V>/(#(
:.2 =.G=&TE(I E><,'V>/S&?ET&4S 'efonte of the document and e5tension of the
perimeter of solver )* to asymmetric
v0/.2 =.G=&TE(I E><,'V>/S&?ET&4S large "orM of bacM in shape (formula figure
legend notice character "hite cast ironH).
Ipdate concerning parameters (in particular
NPRE$ $OE)_DIM_ESPA$EA TOUT6A the
aspects solvers linear and parallelism.
Code_Aster
Version
default
Titre : Rsolution du problme modal quadratique (QEP) Date : 05/05/20 Pa!e : "2/"2
'nne/e 1 nterpretation of the comple/ eigen#alues
&n the case of a s"mmetric damping and in internal absence of damping relations of
orthogonalities and o"ing to the fact that the clean elements appear per combined pairs one has the
follo"ing relations!
1
i
Y
T
C1
i
1
i
Y
T
M1
i
=
c
i
m
i
=2'e(\
i
)
1
i
Y
T
K1
i
1
i
Y
T
M1
i
=
k
i
m
i
=
\
i
2

&f one notes \
i
=o
i
!i
i
one can then define

o
i
=\
i
=
.
o
i
2
+
i
2
=
i
(
i
(
i
='e
(\
i
)
o
i
=
o
i
.
o
i
2
+
i
2
o
i

=ne can "rite the comple5 eigenvalue in the follo"ing form
\
i
=(
i
o
i
!i o
i
.
1(
i
2

4ette formulation induces follo1ing ph"sical interpretation!
The real term represents the dissipative character of the system.
The imaginary part represents the oscillatory part of the solution.
o
i
is the pulsation of t/e ime mode.
(
i
is the damping of t/e ime

mode
o
d
i
=o
i
.
1(
i
2
is the reduced damping of t/e ime mode.
(s for the ph"sical interpretation of the eigen#ectors!
The physical meaning of the e5istence of a comple5 eigenvector lies in the fact that if the structure
vibrates on an eigen mode its various degrees of freedom do not vibrate "ith the same phase the
ones compared to the others.
The modal bellies and nodes do not correspond of the steady points but move during motion.
+ote,
#ne 6inds t/e 0on$entional 6ormulation o6 t/e deadened s4stems 1it/ de!ree o6 6reedom*
k
i
, m
i
and
c
i
are real* T/e4 are man4 intrinsi0 quantities 1it/ a mode (modal quantities)
t/us dependent on its normali>ation*
.e remind t/e meetin! t/at t/e modes o6 t/e 7EP (Aust li<e 0omple@ modes o6 t/e 7EP) do
not dia!onalisent t/e matri@es M, K et C.
&6 t/e real part o6 t/e ei!en$alue is ne!ati$e= t/en t/e ei!en mode is a deadened periodi0
motion o6 pulsation o * &6 on t/e 0ontrar4= it is positi$e= t/en t/e ei!en mode is a periodi0
motion o6 amplitude in0reasin! and t/us unstable*

Code - Aster r5.01.02-1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Code - Aster r5.01.02-1

Uploaded by

Copyright:

Available Formats

Code_Aster

=E(\) ( A\B) F(\)

'l!orit/me "* Pro0edure 6or 0ompute operators o6 1or<

You might also like