background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
05/05/97
Author (S):
J. PELLET
Key:
D5.03.02
Page:
1/12
Mechanical department and Digital Models
Index:
With
Dissemination:
Developers
EDF
Direction of the Studies and Search
Electricity of France
Project Codes of Mechanics
Copyright EDF/DER 1997












Data-processing manual of Description
D5.03 booklet:
D5.03.02 document



To introduce a new loading of the type
“kinematic”




Summary:
This document presents the two utility routines making it possible to introduce the new ones easily
types of boundary conditions “kinematics” (i.e of the linear relations between degrees of freedom
unknown).
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
2/12

Data-processing manual of Description
D5.03 booklet:
Index A

Contents

Contents .......................................................................................................... 2
1 Introduction ................................................................................................................... 3
2 What a linear relation? .............................................................................. 3
3 Comment does one introduce linear relations into a modeling?...................... 4
4 To introduce a new key word of type “linear relation” ............................................. 5
5 routines
AFRELA
and
AFLRCH
.................................................................................. 6
5.1 The routine
AFRELA
.............................................................................................. 6
5.2 The routine
AFLRCH
.............................................................................................. 8
6 Principle of overload ................................................................................................... 8
7 Example: routine
CALIAI
............................................................................................ 9
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
3/12

Data-processing manual of Description
D5.03 booklet:
Index A
1 Introduction

What one calls “loading” in Aster (“mechanical” vocabulary) is what the user defines in
controls
AFFE_CHAR_ *
. One distinguishes the loadings in general of “forces” [D5.03.01] and them
loadings in “displacements” (or “kinematics”).

This document explains how to introduce new loadings kinematics.

2
What a linear relation?

This expression indicates a linear stress on the degrees of freedom of the system to be studied:
·
ddl of the size
TEMP_R
for the thermal phenomenon,
·
ddl of the sizes
DEPL_R
or
DEPL_C
for the mechanical phenomenon,
·
ddl of the size
PRES_C
for the acoustic phenomenon.

The coefficients of this linear relation are real constants (or complexes), the second member
can be real, complex or of type “
function
“(
K8
).

A linear relation can be written:
1
2
0
1
2
ddl
ddl
ddln
N
+
+
+
=

where
I
(or c)
(
)
I
N
= 1,
0
(or c) (or function)

Degrees of freedom
ddl
I
are degrees of freedom carried by one or more different nodes.

Linear examples of relations:
DX (N1) = 0.
blocking of
CMP
DX
“of the node”
N1
TEMP (N3) = 100.
temperature imposed on
100
. for the node “
N3
DY (N1) - DY (N2) = 0.
nodes “
N1
“and”
N2
“have same displacement
DY
cos
.
DX (N1) +
sin
.
DY (N1) = 0.
the node “
N1
“east compels to move on the line
perpendicular with the vector (cos
, sin
) (in 2D).


background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
4/12

Data-processing manual of Description
D5.03 booklet:
Index A
3
How linear relations are introduced
in a modeling?

The linear relations that one defined in [§2] force the solution which one seeks. They make
started from what one in general calls the “boundary conditions”. In Code_Aster they are one of
components of the loads (standard
char_acou
,
char_ther
,
char_meca
).
These linear relations are thus introduced by the user via the controls
AFFE_CHAR_MECA
(_F)
,
AFFE_CHAR_THER (_F)
,
AFFE_CHAR_ACOU
, or
AFFE_CHAR_CINE
.
These linear relations can “dealt” with two ways:
·
one eliminates an unknown factor for each linear relation: method of elimination [D3.03.01],
·
one “dualise” the relation by adding 2 additional unknown factors to him: parameters of
Lagrange [R3.03.01].
In Code_Aster, the method of elimination is used for the relations resulting from the control
AFFE_CHAR_CINE
. One will speak in this case about linear relations “kinematics”, although this term is not
very judicious. One limits oneself then to relations of the type:
DDL = cste
Other relations resulting from the controls
AFFE_CHAR_MECA
,
AFFE_CHAR_THER
and
AFFE_CHAR_ACOU
are always dualisées.
Examples of key words generating factor of the linear relations:
·
AFFE_CHAR_CINE
MECA_IMPO
·
AFFE_CHAR_MECA_F
LIAISON_OBLIQUE
·
AFFE_CHAR_THER
TEMP_IMPO
· AFFE_CHAR_MECA
LIAISON_DDL
The control
AFFE_CHAR_CINE
allows to introduce all the simple linear relations easily (
DDL
= cste
) that one can define.
On the other hand, although in theory (thanks to the key word
LIAISON_DDL
), one can introduce any
linear relation, the number of coefficients to be calculated can become very large. To think for example of the relations
linear that it is necessary to write for saying that 4 nodes are interdependent (connected by an indeformable solid).
The many key words making it possible the user to define these linear relations are there to facilitate it to him
work:
· LIAISON_OBLIQUE
for supports slipping into an oblique reference mark
· TEMP_IMPO
to impose a temperature
· LIAISON_GROUP
to connect nodes two to two
· …
·
and
LIAISON_DDL
for the other cases…

This great word count key (which will be able to only grow) requires to give itself software tools
allowing:
·
not to duplicate a code unnecessarily,
·
to facilitate the introduction of new key words into the controls
AFFE_CHAR_MECA
,
AFFE_CHAR_ACOU
and
AFFE_CHAR_THER
.

It is of these tools about which we will speak in the following paragraphs.
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
5/12

Data-processing manual of Description
D5.03 booklet:
Index A
4
To introduce a new key word of type “linear relation”

We give in this paragraph a skeleton for the writing of a routine “carrying out” a key word of
order
AFFE_CHAR_MECA
(or
_THER
or
_ACOU
). This key word factor allowing the user to define
linear relations.

Are:
MFAC
the key word factor
CAMFAC
the name of the routine corresponding to him

The goal of the routine
CAMFAC
is “to scan” the data of the user behind the key word
MFAC
, of
to translate these data into linear relations and to store these relations in the load (here of type
char_meca
)
that the user is defining.

For that, one has two utility routines:
· AFRELA
:
to assign a linear relation to a SD of the type
LISTE_RELA
(list of linear relations)
· AFRLCH
:
“to add” a SD
LISTE_RELA
with a SD
CHARGE

These routines force to pass by an intermediate SD (temporary) of type
LISTE_RELA
. That
a little the programming weighs down but presents the following advantages:
·
gains of performance, because the routine
AFRLCH
is expensive in
CPU
,
·
a great flexibility to carry out the principle of overload (cf [§?]).

The skeleton of the routine
CAMFAC
is thus the following:
SUBROUTINE CAMFAC
(CH)
CHARACTER * (*) CH
C in jxvar CH
:
SD
CHAR_MECA
to enrich
C drank
:
to enrich the load
CH
definite linear relations
under the key word factor
MFAC

loop on the linear relations
·
acquisition of the coefficients of the linear relation:
I
(routines
GETVXX
),
·
addition of the linear relation with the SD
LISTE_RELA
Cal AFRELA
(
I
,
“&&CAMFAC.LISTE_RELA”
)
fine loops
·
addition of the SD
LIST_RELA
with
CHARGE
:
CH
Cal AFLRCH
(
“&&CAMFAC.LIST_RELA”, CH
)
END
Note:
·
the SD
LISTE_RELA
(temporary) is specific to the routine
CAMFAC,
its name respects the convention of the names of objects of work:
&&nom_routine,
·
the principle of overload (cf [U2.01.00 §3.7]) thus relates to only the occurrences of
key word
MFAC,
· this
SD
is destroyed at the time of the call to
AFLRCH.
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
6/12

Data-processing manual of Description
D5.03 booklet:
Index A
5 Them
routines
AFRELA
and
AFLRCH
5.1
routine
AFRELA
SUBROUTINE AFRELA (COEFR, COEFC, DDL, NODE, NDIM, DIRECT,
+ NBTERM, BETAR, BETAC, BETAF, TYPCOE, TYPVAL, LISREL)
C
C DRANK: ASSIGNMENT Of a RELATION BETWEEN DDLS A a SD LISTE_RELA
C (IF OBJECT LISREL DOES NOT EXIST, IT EAST CREATES)
C
C
C COEFR (NBTERM) - IN - R -: TABLE OF THE COEFFICIENTS OF THE RELATION
C THE COEFFICIENTS ARE REAL
C
C COEFC (NBTERM) - IN - C -: TABLE OF THE COEFFICIENTS OF THE RELATION
C THE COEFFICIENTS ARE COMPLEX
C
C DDL (NBTERM) - IN - K8 -: TABLE OF THE DDL OF THE RELATION
C
C NODE (NBTERM) - IN - K8 -: TABLE OF THE NODES OF THE RELATION
C
C NDIM (NBTERM) - IN - I -: DIMENSION OF THE PROBLEM (0, 2 OR 3)
C IF = 0 CHANGE NO OF REFERENCE MARK
C THE RELATION EAST GIVEN IN THE BASE
C TOTAL
C
C DIRECT (3, NBTERM) - IN - R -: TABLE OF RELATIVE VECTORS A EACH
C TERM DEFINING THE DIRECTION OF
C COMPONENT WHICH ONE WANTS TO FORCE
C
C NBTERM - IN - I -: A NUMBER OF TERMS OF THE RELATION
C
C BETAR - IN - R -: ACTUAL VALUE OF THE SECOND MEMBER
C
C BETAC - IN - C -: VALUE COMPLEXES OF THE SECOND MEMBER
C
C BETAF - IN - K8 -: VALUE FUNCTION OF THE SECOND MEMBER
C
C TYPCOE - IN - K4 -: TYPE OF THE COEFFICIENTS OF THE RELATION:
C = “REAL” OR “COMP”
C
C TYPVAL - IN - K4 -: TYPE OF THE SECOND MEMBER
C = “REAL” OR “COMP” OR “FONC”
C
C LISREL - IN - K19 -: NAME OF SD LISTE_RELA
C - JXVAR -
C

Two cases of figure are to be considered:
has) the ddl to connect are given in the absolute reference mark:
DX, DY
,…
unquestionable b) ddl to be connected are given in a local reference mark.

Case A (all in the absolute reference mark):
NBTERM
is the number of ddl connected by the relation.
NDIM
is a vector filled of
0
DIRECT
is useless.
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
7/12

Data-processing manual of Description
D5.03 booklet:
Index A
Example 1:
one wants to impose:
3.* DX (N1) +2.* DY (N2) - 4.DRZ (N1) = “F” (foncion)
NBTERM
=3
TYPCOE
= ' REEL'
TYPVAL
= ' FONC'
COEFR
= (3. , 2. , - 4. )
NDIM
= (0, 0, 0)
DDL
= (“DX”, “DY”, “DRZ”)
NODE
= (“N1”, “N2”, “N1”
)
BETAF
=
“F”

Case B (local reference mark):

For each node implied in the relation, one can give a local reference mark in which the relation is
simpler (the normal on a surface for example).
Example 2:
that is to say
N
, an unit vector of components (
nx, ny, nz
).
It is wanted that following displacement
N
with the node
N3
that is to say no one.
NBTERM
=1
TYPCOE
= ' REEL'
TYPVAL
= ' REEL'
COEFR
= (1.)
NDIM = (3)
DIRECT
= (nx, ny, nz)
DDL
= (“DEPL”)
NODE
= (“N1”)
BETAR
=
0.
Note:
·
NBTERM
is not the number of terms of the final relation here (:
3
).
·
When one employs (for a “term”) the possibility of a local reference mark
NDIM/= 0
the name
DDL
must be conventionally
“DEPL”
or
“ROTA”
Example 3:
RC
are:
n1
: an unit vector of components (
n1x, n1y, n1z
) and
N2
: an unit vector of components (
N2 X, N2 y, N2 Z
)
following data:
NBTERM
=3
TYPCOE
= ' REEL'
TYPVAL
= ' REEL'
COEFR
= (4., 2., - 3.)
NDIM = (3,0,3)
DIRECT
= (n1x, n1y, n1z, rbid, rbid, rbid, N2 X, N2 y, N2 Z)
DDL
= (“DEPL”, “DX”, “ROTA”)
NODE
= (“N1”, “N3”, “N2”)
BETAR
=
5.
describe the relation in the 7 terms:
4.* (N1X * DX (N1) +N1Y * DY (N1) +N1Z * DZ (N1))
+
2.* DX (N3)
+ - 3.* (N2 X * DX (N2) +n2 y * DY (N2) +n2 Z * DZ (N2))
= 5.
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
8/12

Data-processing manual of Description
D5.03 booklet:
Index A
5.2
routine
AFLRCH
SUBROUTINE AFLRCH (LISREL, LOAD)
C -------------------------------------------------------
C ADDITION Of a LISTE_RELA IN a LOAD
C
C THE IDENTICAL RELATIONS WITHIN LISTE_RELA ARE
C ELIMINEES. THE PRINCIPLE OF OVERLOAD EAST APPLIES:
C It IS the LAST SECOND MEMBER WHO IS PRESERVE.
C -------------------------------------------------------
C LISREL IN/JXVAR - K19 -: NAME OF SD LISTE_RELA
C THE LISTE_RELA EAST DESTROYED
A.C. END OF THE ROUTINE
C -------------------------------------------------------
C CHARGE IN/JXVAR - K8 -: NAME OF THE SD CHARGES
C THE LOAD EAST ENRICHED
C -------------------------------------------------------

6
Principle of overload

It can happen that the user defines several times the same linear relation (in a coefficient
multiplier near).
Example:
3.DX (N1) - 1.DY (N2) = 4.
6.DX (N1) - 2.DY (N2) = 8.
3.DX (N1) - 1.DY (N2) = 5.

Here, the first 2 equations are identical. Third is contradictory with the preceding ones (with
cause of the second member).

If two equations of a linear system to solve have the same 1st member, one cannot reverse
stamp, because the equations are not independent. It is thus necessary to eliminate all the equations which are
multiples from/to each other.

One wants to be able to apply the principle of “overload” [U2.01.00 §3.7]: it is thus the last second
member who is preserved.

This elimination of the “redundant” relations is made at the time or one adds
LISTE_RELA
with
CHARGE
(routine
AFLRCH
). One eliminates the doubled blooms from
LISTE_RELA
, the eliminated relations are printed,
then one adds the relations preserved at
CHARGE
.

If the diagram advised is kept here [§4]: only one
LISTE_RELA
by key word factor, the principle of
overload is thus naturally applied for each key word. The last occurrences precede on
first.

If one wanted (one does not want it today!) an overload between various key words (for example:
DDL_IMPO
precede on
FACE_IMPO
), it would be enough that these 2 key words are associated same
LISTE_RELA
:
CAL FACIMPO (CH, LISREL)
CAL DDLIMPO (CH, LISREL)
CAL AFLRCH (LISREL, CH)
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
9/12

Data-processing manual of Description
D5.03 booklet:
Index A
7
Example: routine
CALIAI
This routine treats the key word
LIAISON_DDL
controls:
·
AFFE_CHAR_MECA (_F)
·
AFFE_CHAR_THER (_F)
SUBROUTINE CALIAI (FONREE, LOAD)
IMPLICIT REAL * 8 (A-H, OZ)
CHARACTER * 4 FONREE
CHARACTER * 8 LOAD
C ----------------------------------------------------------------------
C MODIF MODELIZED DATE 23/01/95 AUTHOR VABHHTS J.PELLET
C
C TO TREAT KEY MOT LIAISON_DDL OF AFFE_CHAR_XXX
C AND TO ENRICH THE LOAD (LOAD) WITH THE LINEAR RELATIONS
C
C IN: FONREE: “REAL” OR “FONC”
C IN/JXVAR: CHARGE: NAME Of a SD CHARGES
C ----------------------------------------------------------------------
C ----------- COMMUN RUNS STANDARDIZE JEVEUX --------------------------
INTEGER ZI
COMMON/IVARJE/ZI (1)
REAL * 8 ZR
COMMON/RVARJE/ZR (1)
COMPLEX * 16 ZC
COMMON/CVARJE/ZC (1)
LOGICAL ZL
COMMON/LVARJE/ZL (1)
CHARACTER * 8 ZK8
CHARACTER * 16 ZK16
CHARACTER * 24 ZK24
CHARACTER * 32 ZK32
CHARACTER * 80 ZK80
COMMON/KVARJE/ZK8 (1), ZK16 (1), ZK24 (1), ZK32 (1), ZK80 (1)
CHARACTER * 32 JEXNOM, JEXNUM
C FINE COMMUN RUNS STANDARDIZE JEVEUX ----------------------
C
COMPLEX * 16 BETAC
CHARACTER * 7 TYPCHA
CHARACTER * 8 BETAF
CHARACTER * 8 K8BID, MOTCLE, MOGROU, MOD, NAMED, NOMNOE
CHARACTER * 16 MOTFAC
CHARACTER * 19 LISREL
CHARACTER * 24 WK., GROUMA, NOEUMA
CHARACTER * 19 LIGRMO
C ----------------------------------------------------------------------
C
MOTFAC = “LIAISON_DDL”
MOTCLE = “NODE”
MOGROU = “GROUP_NO”
LISREL = “&&CALIAI.RLLISTE”
CAL GETFAC (MOTFAC, NLIAI)
IF (NLIAI.EQ.0) RETURN
C
BETAC = (1.0D0,0.0D0)
C
C
CAL DISMOI (“F”, “TYPE_CHARGE”, LOAD, “LOAD”, IBID,
+ TYPCHA, IER)
CAL DISMOI (“F”, “NOM_MODELE”, LOAD, “LOAD”, IBID, MOD, IER)
CAL DISMOI (“F”, “NOM_MAILLA”, LOAD, “LOAD”, IBID, NAMED, IER)
C
NOEUMA = NAMED//“.NOMNOE”
GROUMA = NAMED//“.GROUPENO”
C
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
10/12

Data-processing manual of Description
D5.03 booklet:
Index A

C -- CALCULATION OF NDIM1: NO. MAXIMUM TERMS Of a LIST
C GROUP_NO OR OF NODE
C --------------------------------------------------
NDIM1 = 0
C 10 I=1, NLIAI
CAL GETVID (MOTFAC, MOGROU, I, 1,0, K8BID, NENT)
NDIM1 = MAX (NDIM1, - NENT)
CAL GETVID (MOTFAC, MOTCLE, I, 1,0, K8BID, NENT)
NDIM1 = MAX (NDIM1, - NENT)
10 CONTINUOUS

WK. = “&&CALIAI.”//MOTFAC
CAL WKVECT (WK., “V V K8”, NDIM1, JJJ)

C -- CALCULATION OF NDIM2 AND CHECKING OF THE NODES AND GROUP_NO
C NDIM2 EAST THE MAXIMUM NUMBER OF NODES IMPLY IN ONE
C LINEAR RELATION
C -------------------------------------------------------
NDIM2 = NDIM1
C 20 IOCC = 1, NLIAI
CAL GETVID (MOTFAC, MOGROU, IOCC, 1, NDIM1, ZK8 (JJJ), NGR)
NBGT = 0
C 30 IGR = 1, NGR
CAL JEEXIN (JEXNOM (GROUMA, ZK8 (JJJ+IGR-1)), IRET)
IF (IRET .EQ. 0) THEN
CAL UTMESS (“F”, MOTFAC, “THE GROUP”//ZK8 (JJJ+IGR-1)//
+ “DOES NOT FORM PART OF THE MESH: ”//NAMED)
ELSE
CAL JELIRA (JEXNOM (GROUMA, ZK8 (JJJ+IGR-1)), “LONMAX”,
+ N1, '')
NBGT = NBGT + N1
ENDIF
30 CONTINUOUS
NDIM2 = MAX (NDIM2, NBGT)

CAL GETVID (MOTFAC, MOTCLE, IOCC, 1, NDIM1, ZK8 (JJJ), NO)
C 40 INO = 1, NO
CAL JENONU (JEXNOM (NOEUMA, ZK8 (JJJ+INO-1)), IRET)
IF (IRET .EQ. 0) THEN
CAL UTMESS (“F”, MOTFAC, MOTCLE//''//ZK8 (JJJ+INO-1)//
+ “DOES NOT FORM PART OF THE MESH: ”//NAMED)
ENDIF
40 CONTINUOUS
20 CONTINUOUS
C
C
C -- ALLOWANCE OF TABLES OF WORK
C -------------------------------------
CAL WKVECT (“&&CALIAI.LISTE1”, “V V K8”, NDIM1, JLIST1)
CAL WKVECT (“&&CALIAI.LISTE2”, “V V K8”, NDIM2, JLIST2)
CAL WKVECT (“&&CALIAI.DDL”, “V V K8”, NDIM2, JDDL)
CAL WKVECT (“&&CALIAI.COEMUR”, “V V R”, NDIM2, JCMUR)
CAL WKVECT (“&&CALIAI.COEMUC”, “V V It, NDIM2, JCMUC)
CAL WKVECT (“&&CALIAI.DIRECT”, “V V R”, 3 * NDIM2, JDIREC)
CAL WKVECT (“&&CALIAI.DIMENSION”, “V V I”, NDIM2, JDIME)
C
C
C
C LOOP ON THE LINEAR RELATIONS
C -----------------------------------
C 50 I = 1, NLIAI
CAL GETVR8 (MOTFAC, “COEF_MULT”, I, 1, NDIM1, ZR (JCMUR), N2)
CAL GETVTX (MOTFAC, “DDL”, I, 1, NDIM1, ZK8 (JDDL), N1)
C
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
11/12

Data-processing manual of Description
D5.03 booklet:
Index A

C EXCEPTION:IF KEY WORD DDL DOES NOT EXIST IN AFFE_CHAR_THER,
C IT IS CONSIDERED THAT THE LINEAR RELATIONS CARRY
C ON THE DDL “TEMP”
IF (N1.EQ.0.AND.TYPCHA (1:4) .EQ.“THER”) THEN
N1 = N2
C 60 K=1, N1
ZK8 (JDDL-1+K) = “TEMP”
60 CONTINUOUS
ENDIF

IF (N1.NE.N2) THEN
CAL UTDEBM (“F”, “CALIAI”, “THE NUMBER OF DDLS APPEARING IN”
&//“THE CONNECTION NR '' IS NOT EQUAL TO THE NUMBER OF COEF_MULT:”)
CAL UTIMPI (“, '', 1, N1)
CAL UTIMPI (“, '', 1, N2)
CAL UTFINM ()
ENDIF

C -- RECOVERY OF THE 2ND MEMBER:
C ------------------------------
IF (FONREE.EQ.“REAL”) THEN
CAL GETVR8 (MOTFAC, “COEF_IMPO”, I, 1, 1, BETA, NB)
ELSE IF (FONREE.EQ.“FONC”) THEN
CAL GETVID (MOTFAC, “COEF_IMPO”, I, 1, 1, BETAF, NB)
ELSE
CAL UTMESS (“F”, “CALIAI”, “CASE NOT ENVISAGED”)
ENDIF
C
C
CAL GETVID (MOTFAC, “GROUP_NO”, I, 1,0, ZK8 (JLIST1), NG)
IF (NG .NE.0) THEN
C
C
C -- CASE OF GROUP_NO:
C --------------------
NG = - NG
CAL GETVID (MOTFAC, “GROUP_NO”, I, 1, NG, ZK8 (JLIST1), NR)
INDNOE = 0
C 80 J = 1, NG
CAL JEVEUO (JEXNOM (GROUMA, ZK8 (JLIST1-1+J)), “It, JGR0)
CAL JELIRA (JEXNOM (GROUMA, ZK8 (JLIST1-1+J)), “LONMAX”,
+ NR, '')
C 90 K = 1, NR
IN = ZI (JGR0-1+K)
INDNOE = INDNOE + 1
CAL JENUNO (JEXNUM (//“.NOMNOE NAMED”, IN), NOMNOE)
ZK8 (JLIST2+INDNOE-1) = NOMNOE
90 CONTINUOUS
80 CONTINUOUS
C
C ASSIGNMENT OF THE RELATION WITH THE LISTE_RELA:
C --------------------------------------------
CAL AFRELA (ZR (JCMUR), ZC (JCMUC), ZK8 (JDDL), ZK8 (JLIST2),
+ ZI (JDIME), ZR (JDIREC), INDNOE, BETA, BETAC, BETAF,
+ FONREE, FONREE, LISREL)
C
C
ELSE
C
C
C CASE OF NODE:
C -------------
CAL GETVID (MOTFAC, “NODE”, I, 1, 0, ZK8 (JLIST1), NBNO)
IF (NBNO .NE. 0) THEN
NBNO=-NBNO
CAL GETVID (MOTFAC, “NODE”, I, 1, NBNO, ZK8 (JLIST1), NR)
ENDIF
C
background image
Code_Aster
®
Version 4
Titrate
:
To introduce a new loading of the “kinematic” type
Date:
18/09/2003
Author (S):
J. PELLET
Key:
D5.03.02
Page:
12/12

Data-processing manual of Description
D5.03 booklet:
Index A

C ASSIGNMENT OF THE RELATION WITH THE LISTE_RELA:
C --------------------------------------------
CAL AFRELA (ZR (JCMUR), ZC (JCMUC), ZK8 (JDDL), ZK8 (JLIST1),
+ ZI (JDIME), ZR (JDIREC), NBNO, BETA, BETAC, BETAF,
+ FONREE, FONREE, LISREL)
ENDIF
C
50 CONTINUOUS
C
C
C -- ADDITION OF THE LISTE_RELA TO THE LOAD:
C ---------------------------------------
CAL AFLRCH (LISREL, LOAD)
C
C
C -- SPARE:
C -----------
CAL JEDETR (WK.)
CAL JEDETR (“&&CALIAI.LISTE1”)
CAL JEDETR (“&&CALIAI.LISTE2”)
CAL JEDETR (“&&CALIAI.DDL”)
CAL JEDETR (“&&CALIAI.COEMUR”)
CAL JEDETR (“&&CALIAI.COEMUC”)
CAL JEDETR (“&&CALIAI.DIRECT”)
CAL JEDETR (“&&CALIAI.DIMENSION”)
C
END