36 #include <lifev/core/array/MatrixElemental.hpp> 51 _nRow.resize ( _nBlockRow );
52 _firstRow.resize ( _nBlockRow );
53 _nCol.resize ( _nBlockCol );
54 _firstCol.resize ( _nBlockCol );
57 for (
UInt n = 0; n < nbr1; n++ )
60 _firstRow[ n ] = first;
65 for (
UInt n = 0; n < nbc1; n++ )
68 _firstCol[ n ] = first;
81 _nRow.resize ( _nBlockRow );
82 _firstRow.resize ( _nBlockRow );
83 _nCol.resize ( _nBlockCol );
84 _firstCol.resize ( _nBlockCol );
87 for ( n = 0; n < nbr1; n++ )
90 _firstRow[ n ] = first;
93 for ( n = nbr1; n < nbr1 + nbr2; n++ )
96 _firstRow[ n ] = first;
101 for ( n = 0; n < nbc1; n++ )
104 _firstCol[ n ] = first;
107 for ( n = nbc1; n < nbc1 + nbc2; n++ )
110 _firstCol[ n ] = first;
126 _nRow.resize ( _nBlockRow );
127 _firstRow.resize ( _nBlockRow );
128 _nCol.resize ( _nBlockCol );
129 _firstCol.resize ( _nBlockCol );
132 for ( n = 0; n < nbr1; n++ )
135 _firstRow[ n ] = first;
138 for ( n = nbr1; n < nbr1 + nbr2; n++ )
141 _firstRow[ n ] = first;
144 for ( n = nbr1 + nbr2; n < nbr1 + nbr2 + nbr3; n++ )
147 _firstRow[ n ] = first;
152 for ( n = 0; n < nbc1; n++ )
155 _firstCol[ n ] = first;
158 for ( n = nbc1; n < nbc1 + nbc2; n++ )
161 _firstCol[ n ] = first;
164 for ( n = nbc1 + nbc2; n < nbc1 + nbc2 + nbc3; n++ )
167 _firstCol[ n ] = first;
179 c <<
"Block (" << i <<
"," << j <<
"), ";
180 c << block ( i, j ) << std::endl;
MatrixElemental(UInt nNode1, UInt nbr1, UInt nbc1, UInt nNode2, UInt nbr2, UInt nbc2, UInt nNode3, UInt nbr3, UInt nbc3)
void updateInverseJacobian(const UInt &iQuadPt)
void showMe(std::ostream &c=std::cout)
MatrixElemental(UInt nNode1, UInt nbr1, UInt nbc1, UInt nNode2, UInt nbr2, UInt nbc2)
This is the constructor for the local matrix involving 2 finite elements.
MatrixElemental(UInt nNode1, UInt nbr1, UInt nbc1)
uint32_type UInt
generic unsigned integer (used mainly for addressing)