• Aucun résultat trouvé

Operator ASSE_VECTEUR Code_Aster

N/A
N/A
Protected

Academic year: 2022

Partager "Operator ASSE_VECTEUR Code_Aster"

Copied!
2
0
0

Texte intégral

(1)

Code_Aster Version default

Titre :

Opérateur ASSE_VECTEUR

Date :

20/04/2009

Page :

1/2

Responsable :

PELLET Jacques

Clé :

U4.61.23

Révision :

3901d854a55a

Operator ASSE_VECTEUR

1 Goal

To build a field with the nodes by assembly of elementary vectors.

This field will be able, for example, being used like second member for the resolution of a linear system.

Product a structure of data cham_no.

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Copyright 2021 EDF R&D - Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

(2)

Code_Aster Version default

Titre :

Opérateur ASSE_VECTEUR

Date :

20/04/2009

Page :

2/2

Responsable :

PELLET Jacques

Clé :

U4.61.23

Révision :

3901d854a55a

2 Syntax

vecas [cham_no] = ASSE_VECTEUR

( ♦ VECT_ELEM = lvel, [l_vect_elem]

♦ NUME_DDL = naked , [nume_ddl]

◊ INFORMATION = / 1,

= / 2, )

3 Operands

3.1 Operand VECT_ELEM

♦ VECT_ELEM = lvel

List of the concepts of the type vect_elem to assemble. The various elementary vectors are summoned in the same assembled vector (of type cham_no). The assembly is licit only if the various concepts vect_elem all correspond to the same size DEPL_R, TEMP_R, PRES_R or PRES_C.

3.2 Operand NUME_DDL

♦ NUME_DDL = naked

Defines the classification of the degrees of freedom to use for the assembled vector.

Warning : The translation process used on this website is a "Machine Translation". It may be imprecise and inaccurate in whole or in part and is provided as a convenience.

Copyright 2021 EDF R&D - Licensed under the terms of the GNU FDL (http://www.gnu.org/copyleft/fdl.html)

Références

Documents relatifs

This order is seldom useful and it presents the disadvantage of doubling space “disc” of the concept in the total base of the user.. The produced concept can be destroyed (order

dd: partial factorization since dd - ième equation included (in internal classification established by the operator NUME_DDL [U4.61.11]). ◊ / BLOC_FIN

On the other hand, with the method PETSC, one uses the same matrix for MATR_PREC and MATR, which wants to say that the order TO FACTORIZE must be made “places from there” (with

Les différents vecteurs élémentaires sont sommés dans un même vecteur assemblé (de type cham_no). L'assemblage n'est licite que si les différents concepts vect_elem correspondent

The destruction of concepts (which results in the destruction of the JEVEUX objects constituting data structures) makes it possible to prepare a reduction of

If the type of the concept that you want to duplicate does not appear in this list, it is necessary to emit a request for evolution..

dd: partial factorization since the dd-ième equation included (in internal classification established by the operator NUME_DDL [U4.61.11]). ◊/BLOC_FIN

On the other hand, with method PETSC, it is advised to use the same matrix for MATR_PREC and MATR, which wants to say that the command TO FACTORIZE must be made “places