Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F60553100
ElementQuad4Planar.hpp
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Wed, May 1, 01:33
Size
17 KB
Mime Type
text/x-c
Expires
Fri, May 3, 01:33 (2 d)
Engine
blob
Format
Raw Data
Handle
17372721
Attached To
rGOOSEFEM GooseFEM
ElementQuad4Planar.hpp
View Options
/* =================================================================================================
(c - GPLv3) T.W.J. de Geus (Tom) | tom@geus.me | www.geus.me | github.com/tdegeus/GooseFEM
================================================================================================= */
#ifndef GOOSEFEM_ELEMENTQUAD4PLANAR_CPP
#define GOOSEFEM_ELEMENTQUAD4PLANAR_CPP
// -------------------------------------------------------------------------------------------------
#include "GooseFEM.h"
// =================================================================================================
namespace
GooseFEM
{
namespace
Element
{
namespace
Quad4
{
// =================================================================================================
inline
QuadraturePlanar
::
QuadraturePlanar
(
const
xt
::
xtensor
<
double
,
3
>
&
x
,
const
xt
::
xtensor
<
double
,
2
>
&
xi
,
const
xt
::
xtensor
<
double
,
1
>
&
w
,
double
thick
)
:
m_x
(
x
),
m_w
(
w
),
m_xi
(
xi
),
m_thick
(
thick
)
{
// check input
assert
(
m_x
.
shape
()[
1
]
==
m_nne
);
assert
(
m_x
.
shape
()[
2
]
==
m_ndim
);
// extract number of elements and number of integration points
m_nelem
=
m_x
.
shape
()[
0
];
m_nip
=
m_w
.
size
();
// check input
assert
(
m_xi
.
shape
()[
0
]
==
m_nip
);
assert
(
m_xi
.
shape
()[
1
]
==
m_ndim
);
assert
(
m_w
.
size
()
==
m_nip
);
// allocate arrays
m_N
=
xt
::
empty
<
double
>
({
m_nip
,
m_nne
});
m_dNxi
=
xt
::
empty
<
double
>
({
m_nip
,
m_nne
,
m_ndim
});
m_dNx
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
,
m_nne
,
m_ndim
});
m_vol
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
});
// shape functions
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
m_N
(
q
,
0
)
=
.25
*
(
1.
-
m_xi
(
q
,
0
))
*
(
1.
-
m_xi
(
q
,
1
));
m_N
(
q
,
1
)
=
.25
*
(
1.
+
m_xi
(
q
,
0
))
*
(
1.
-
m_xi
(
q
,
1
));
m_N
(
q
,
2
)
=
.25
*
(
1.
+
m_xi
(
q
,
0
))
*
(
1.
+
m_xi
(
q
,
1
));
m_N
(
q
,
3
)
=
.25
*
(
1.
-
m_xi
(
q
,
0
))
*
(
1.
+
m_xi
(
q
,
1
));
}
// shape function gradients in local coordinates
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - dN / dxi_0
m_dNxi
(
q
,
0
,
0
)
=
-
.25
*
(
1.
-
m_xi
(
q
,
1
));
m_dNxi
(
q
,
1
,
0
)
=
+
.25
*
(
1.
-
m_xi
(
q
,
1
));
m_dNxi
(
q
,
2
,
0
)
=
+
.25
*
(
1.
+
m_xi
(
q
,
1
));
m_dNxi
(
q
,
3
,
0
)
=
-
.25
*
(
1.
+
m_xi
(
q
,
1
));
// - dN / dxi_1
m_dNxi
(
q
,
0
,
1
)
=
-
.25
*
(
1.
-
m_xi
(
q
,
0
));
m_dNxi
(
q
,
1
,
1
)
=
-
.25
*
(
1.
+
m_xi
(
q
,
0
));
m_dNxi
(
q
,
2
,
1
)
=
+
.25
*
(
1.
+
m_xi
(
q
,
0
));
m_dNxi
(
q
,
3
,
1
)
=
+
.25
*
(
1.
-
m_xi
(
q
,
0
));
}
// compute the shape function gradients, based on "x"
compute_dN
();
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
dV
(
xt
::
xtensor
<
double
,
2
>
&
qscalar
)
const
{
assert
(
qscalar
.
shape
()[
0
]
==
m_nelem
);
assert
(
qscalar
.
shape
()[
1
]
==
m_nip
);
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
qscalar
(
e
,
q
)
=
m_vol
(
e
,
q
);
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
dV
(
xt
::
xtensor
<
double
,
4
>
&
qtensor
)
const
{
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nne
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
for
(
size_t
i
=
0
;
i
<
m_tdim
;
++
i
)
for
(
size_t
j
=
0
;
j
<
m_tdim
;
++
j
)
qtensor
(
e
,
q
,
i
,
j
)
=
m_vol
(
e
,
q
);
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
update_x
(
const
xt
::
xtensor
<
double
,
3
>
&
x
)
{
assert
(
x
.
shape
()[
0
]
==
m_nelem
);
assert
(
x
.
shape
()[
1
]
==
m_nne
);
assert
(
x
.
shape
()[
2
]
==
m_ndim
);
assert
(
x
.
size
()
==
m_x
.
size
()
);
// update positions
xt
::
noalias
(
m_x
)
=
x
;
// update the shape function gradients for the new "x"
compute_dN
();
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
compute_dN
()
{
// loop over all elements (in parallel)
#pragma omp parallel
{
// allocate local variables
T2
J
,
Jinv
;
#pragma omp for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias nodal positions
auto
x
=
xt
::
adapt
(
&
m_x
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// loop over integration points
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
dNxi
=
xt
::
adapt
(
&
m_dNxi
(
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// - Jacobian (loops unrolled for efficiency)
// J(i,j) += dNxi(m,i) * x(m,j);
J
(
0
,
0
)
=
dNxi
(
0
,
0
)
*
x
(
0
,
0
)
+
dNxi
(
1
,
0
)
*
x
(
1
,
0
)
+
dNxi
(
2
,
0
)
*
x
(
2
,
0
)
+
dNxi
(
3
,
0
)
*
x
(
3
,
0
);
J
(
0
,
1
)
=
dNxi
(
0
,
0
)
*
x
(
0
,
1
)
+
dNxi
(
1
,
0
)
*
x
(
1
,
1
)
+
dNxi
(
2
,
0
)
*
x
(
2
,
1
)
+
dNxi
(
3
,
0
)
*
x
(
3
,
1
);
J
(
1
,
0
)
=
dNxi
(
0
,
1
)
*
x
(
0
,
0
)
+
dNxi
(
1
,
1
)
*
x
(
1
,
0
)
+
dNxi
(
2
,
1
)
*
x
(
2
,
0
)
+
dNxi
(
3
,
1
)
*
x
(
3
,
0
);
J
(
1
,
1
)
=
dNxi
(
0
,
1
)
*
x
(
0
,
1
)
+
dNxi
(
1
,
1
)
*
x
(
1
,
1
)
+
dNxi
(
2
,
1
)
*
x
(
2
,
1
)
+
dNxi
(
3
,
1
)
*
x
(
3
,
1
);
// - determinant and inverse of the Jacobian
double
Jdet
=
inv
(
J
,
Jinv
);
// - shape function gradients wrt global coordinates (loops partly unrolled for efficiency)
// dNx(m,i) += Jinv(i,j) * dNxi(m,j);
for
(
size_t
m
=
0
;
m
<
m_nne
;
++
m
)
{
dNx
(
m
,
0
)
=
Jinv
(
0
,
0
)
*
dNxi
(
m
,
0
)
+
Jinv
(
0
,
1
)
*
dNxi
(
m
,
1
);
dNx
(
m
,
1
)
=
Jinv
(
1
,
0
)
*
dNxi
(
m
,
0
)
+
Jinv
(
1
,
1
)
*
dNxi
(
m
,
1
);
}
// - integration point volume
m_vol
(
e
,
q
)
=
m_w
(
q
)
*
Jdet
*
m_thick
;
}
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
gradN_vector
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
,
xt
::
xtensor
<
double
,
4
>
&
qtensor
)
const
{
assert
(
elemvec
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemvec
.
shape
()[
1
]
==
m_nne
);
assert
(
elemvec
.
shape
()[
2
]
==
m_ndim
);
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nne
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
// zero-initialize output: matrix of tensors
qtensor
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias element vector (e.g. nodal displacements)
auto
u
=
xt
::
adapt
(
&
elemvec
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
gradu
=
xt
::
adapt
(
&
qtensor
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_tdim
,
m_tdim
>
());
// - evaluate dyadic product (loops unrolled for efficiency)
// gradu(i,j) += dNx(m,i) * u(m,j)
gradu
(
0
,
0
)
=
dNx
(
0
,
0
)
*
u
(
0
,
0
)
+
dNx
(
1
,
0
)
*
u
(
1
,
0
)
+
dNx
(
2
,
0
)
*
u
(
2
,
0
)
+
dNx
(
3
,
0
)
*
u
(
3
,
0
);
gradu
(
0
,
1
)
=
dNx
(
0
,
0
)
*
u
(
0
,
1
)
+
dNx
(
1
,
0
)
*
u
(
1
,
1
)
+
dNx
(
2
,
0
)
*
u
(
2
,
1
)
+
dNx
(
3
,
0
)
*
u
(
3
,
1
);
gradu
(
1
,
0
)
=
dNx
(
0
,
1
)
*
u
(
0
,
0
)
+
dNx
(
1
,
1
)
*
u
(
1
,
0
)
+
dNx
(
2
,
1
)
*
u
(
2
,
0
)
+
dNx
(
3
,
1
)
*
u
(
3
,
0
);
gradu
(
1
,
1
)
=
dNx
(
0
,
1
)
*
u
(
0
,
1
)
+
dNx
(
1
,
1
)
*
u
(
1
,
1
)
+
dNx
(
2
,
1
)
*
u
(
2
,
1
)
+
dNx
(
3
,
1
)
*
u
(
3
,
1
);
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
gradN_vector_T
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
,
xt
::
xtensor
<
double
,
4
>
&
qtensor
)
const
{
assert
(
elemvec
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemvec
.
shape
()[
1
]
==
m_nne
);
assert
(
elemvec
.
shape
()[
2
]
==
m_ndim
);
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nne
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
// zero-initialize output: matrix of tensors
qtensor
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias element vector (e.g. nodal displacements)
auto
u
=
xt
::
adapt
(
&
elemvec
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
gradu
=
xt
::
adapt
(
&
qtensor
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_tdim
,
m_tdim
>
());
// - evaluate transpose of dyadic product (loops unrolled for efficiency)
// gradu(j,i) += dNx(m,i) * u(m,j)
gradu
(
0
,
0
)
=
dNx
(
0
,
0
)
*
u
(
0
,
0
)
+
dNx
(
1
,
0
)
*
u
(
1
,
0
)
+
dNx
(
2
,
0
)
*
u
(
2
,
0
)
+
dNx
(
3
,
0
)
*
u
(
3
,
0
);
gradu
(
1
,
0
)
=
dNx
(
0
,
0
)
*
u
(
0
,
1
)
+
dNx
(
1
,
0
)
*
u
(
1
,
1
)
+
dNx
(
2
,
0
)
*
u
(
2
,
1
)
+
dNx
(
3
,
0
)
*
u
(
3
,
1
);
gradu
(
0
,
1
)
=
dNx
(
0
,
1
)
*
u
(
0
,
0
)
+
dNx
(
1
,
1
)
*
u
(
1
,
0
)
+
dNx
(
2
,
1
)
*
u
(
2
,
0
)
+
dNx
(
3
,
1
)
*
u
(
3
,
0
);
gradu
(
1
,
1
)
=
dNx
(
0
,
1
)
*
u
(
0
,
1
)
+
dNx
(
1
,
1
)
*
u
(
1
,
1
)
+
dNx
(
2
,
1
)
*
u
(
2
,
1
)
+
dNx
(
3
,
1
)
*
u
(
3
,
1
);
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
symGradN_vector
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
,
xt
::
xtensor
<
double
,
4
>
&
qtensor
)
const
{
assert
(
elemvec
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemvec
.
shape
()[
1
]
==
m_nne
);
assert
(
elemvec
.
shape
()[
2
]
==
m_ndim
);
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nne
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
// zero-initialize output: matrix of tensors
qtensor
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias element vector (e.g. nodal displacements)
auto
u
=
xt
::
adapt
(
&
elemvec
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
eps
=
xt
::
adapt
(
&
qtensor
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_tdim
,
m_tdim
>
());
// - evaluate symmetrized dyadic product (loops unrolled for efficiency)
// grad(i,j) += dNx(m,i) * u(m,j)
// eps (j,i) = 0.5 * ( grad(i,j) + grad(j,i) )
eps
(
0
,
0
)
=
dNx
(
0
,
0
)
*
u
(
0
,
0
)
+
dNx
(
1
,
0
)
*
u
(
1
,
0
)
+
dNx
(
2
,
0
)
*
u
(
2
,
0
)
+
dNx
(
3
,
0
)
*
u
(
3
,
0
);
eps
(
1
,
1
)
=
dNx
(
0
,
1
)
*
u
(
0
,
1
)
+
dNx
(
1
,
1
)
*
u
(
1
,
1
)
+
dNx
(
2
,
1
)
*
u
(
2
,
1
)
+
dNx
(
3
,
1
)
*
u
(
3
,
1
);
eps
(
0
,
1
)
=
(
dNx
(
0
,
0
)
*
u
(
0
,
1
)
+
dNx
(
1
,
0
)
*
u
(
1
,
1
)
+
dNx
(
2
,
0
)
*
u
(
2
,
1
)
+
dNx
(
3
,
0
)
*
u
(
3
,
1
)
+
dNx
(
0
,
1
)
*
u
(
0
,
0
)
+
dNx
(
1
,
1
)
*
u
(
1
,
0
)
+
dNx
(
2
,
1
)
*
u
(
2
,
0
)
+
dNx
(
3
,
1
)
*
u
(
3
,
0
)
)
*
0.5
;
eps
(
1
,
0
)
=
eps
(
0
,
1
);
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
int_N_scalar_NT_dV
(
const
xt
::
xtensor
<
double
,
2
>
&
qscalar
,
xt
::
xtensor
<
double
,
3
>
&
elemmat
)
const
{
assert
(
qscalar
.
shape
()[
0
]
==
m_nelem
);
assert
(
qscalar
.
shape
()[
1
]
==
m_nip
);
assert
(
elemmat
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemmat
.
shape
()[
1
]
==
m_nne
*
m_ndim
);
assert
(
elemmat
.
shape
()[
2
]
==
m_nne
*
m_ndim
);
// zero-initialize: matrix of matrices
elemmat
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias (e.g. mass matrix)
auto
M
=
xt
::
adapt
(
&
elemmat
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
*
m_ndim
,
m_nne
*
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
N
=
xt
::
adapt
(
&
m_N
(
q
,
0
),
xt
::
xshape
<
m_nne
>
());
auto
&
vol
=
m_vol
(
e
,
q
);
auto
&
rho
=
qscalar
(
e
,
q
);
// - evaluate scalar product, for all dimensions, and assemble
// M(m*ndim+i,n*ndim+i) += N(m) * scalar * N(n) * dV
for
(
size_t
m
=
0
;
m
<
m_nne
;
++
m
)
{
for
(
size_t
n
=
0
;
n
<
m_nne
;
++
n
)
{
M
(
m
*
m_ndim
+
0
,
n
*
m_ndim
+
0
)
+=
N
(
m
)
*
rho
*
N
(
n
)
*
vol
;
M
(
m
*
m_ndim
+
1
,
n
*
m_ndim
+
1
)
+=
N
(
m
)
*
rho
*
N
(
n
)
*
vol
;
}
}
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
int_gradN_dot_tensor2_dV
(
const
xt
::
xtensor
<
double
,
4
>
&
qtensor
,
xt
::
xtensor
<
double
,
3
>
&
elemvec
)
const
{
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nip
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
assert
(
elemvec
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemvec
.
shape
()[
1
]
==
m_nne
);
assert
(
elemvec
.
shape
()[
2
]
==
m_ndim
);
// zero-initialize output: matrix of vectors
elemvec
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias (e.g. nodal force)
auto
f
=
xt
::
adapt
(
&
elemvec
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
)
{
// - alias
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
sig
=
xt
::
adapt
(
&
qtensor
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_tdim
,
m_tdim
>
());
auto
&
vol
=
m_vol
(
e
,
q
);
// - evaluate dot product, and assemble
for
(
size_t
m
=
0
;
m
<
m_nne
;
++
m
)
{
f
(
m
,
0
)
+=
(
dNx
(
m
,
0
)
*
sig
(
0
,
0
)
+
dNx
(
m
,
1
)
*
sig
(
1
,
0
)
)
*
vol
;
f
(
m
,
1
)
+=
(
dNx
(
m
,
0
)
*
sig
(
0
,
1
)
+
dNx
(
m
,
1
)
*
sig
(
1
,
1
)
)
*
vol
;
}
}
}
}
// -------------------------------------------------------------------------------------------------
inline
void
QuadraturePlanar
::
int_gradN_dot_tensor4_dot_gradNT_dV
(
const
xt
::
xtensor
<
double
,
6
>
&
qtensor
,
xt
::
xtensor
<
double
,
3
>
&
elemmat
)
const
{
assert
(
qtensor
.
shape
()[
0
]
==
m_nelem
);
assert
(
qtensor
.
shape
()[
1
]
==
m_nip
);
assert
(
qtensor
.
shape
()[
2
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
3
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
4
]
==
m_tdim
);
assert
(
qtensor
.
shape
()[
5
]
==
m_tdim
);
assert
(
elemmat
.
shape
()[
0
]
==
m_nelem
);
assert
(
elemmat
.
shape
()[
1
]
==
m_nne
*
m_ndim
);
assert
(
elemmat
.
shape
()[
2
]
==
m_nne
*
m_ndim
);
// zero-initialize output: matrix of vector
elemmat
.
fill
(
0.0
);
// loop over all elements (in parallel)
#pragma omp parallel for
for
(
size_t
e
=
0
;
e
<
m_nelem
;
++
e
)
{
// alias (e.g. nodal force)
auto
K
=
xt
::
adapt
(
&
elemmat
(
e
,
0
,
0
),
xt
::
xshape
<
m_nne
*
m_ndim
,
m_nne
*
m_ndim
>
());
// loop over all integration points in element "e"
for
(
size_t
q
=
0
;
q
<
m_nip
;
++
q
){
// - alias
auto
dNx
=
xt
::
adapt
(
&
m_dNx
(
e
,
q
,
0
,
0
),
xt
::
xshape
<
m_nne
,
m_ndim
>
());
auto
C
=
xt
::
adapt
(
&
qtensor
(
e
,
q
,
0
,
0
,
0
,
0
),
xt
::
xshape
<
m_tdim
,
m_tdim
,
m_tdim
,
m_tdim
>
());
auto
&
vol
=
m_vol
(
e
,
q
);
// - evaluate dot product, and assemble
for
(
size_t
m
=
0
;
m
<
m_nne
;
++
m
)
for
(
size_t
n
=
0
;
n
<
m_nne
;
++
n
)
for
(
size_t
i
=
0
;
i
<
m_ndim
;
++
i
)
for
(
size_t
j
=
0
;
j
<
m_ndim
;
++
j
)
for
(
size_t
k
=
0
;
k
<
m_ndim
;
++
k
)
for
(
size_t
l
=
0
;
l
<
m_ndim
;
++
l
)
K
(
m
*
m_ndim
+
j
,
n
*
m_ndim
+
k
)
+=
dNx
(
m
,
i
)
*
C
(
i
,
j
,
k
,
l
)
*
dNx
(
n
,
l
)
*
vol
;
}
}
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
2
>
QuadraturePlanar
::
dV
()
const
{
xt
::
xtensor
<
double
,
2
>
out
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
});
this
->
dV
(
out
);
return
out
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
4
>
QuadraturePlanar
::
dVtensor
()
const
{
xt
::
xtensor
<
double
,
4
>
out
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
,
m_tdim
,
m_tdim
});
this
->
dV
(
out
);
return
out
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
4
>
QuadraturePlanar
::
gradN_vector
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
)
const
{
xt
::
xtensor
<
double
,
4
>
qtensor
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
,
m_tdim
,
m_tdim
});
this
->
gradN_vector
(
elemvec
,
qtensor
);
return
qtensor
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
4
>
QuadraturePlanar
::
gradN_vector_T
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
)
const
{
xt
::
xtensor
<
double
,
4
>
qtensor
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
,
m_tdim
,
m_tdim
});
this
->
gradN_vector_T
(
elemvec
,
qtensor
);
return
qtensor
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
4
>
QuadraturePlanar
::
symGradN_vector
(
const
xt
::
xtensor
<
double
,
3
>
&
elemvec
)
const
{
xt
::
xtensor
<
double
,
4
>
qtensor
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nip
,
m_tdim
,
m_tdim
});
this
->
symGradN_vector
(
elemvec
,
qtensor
);
return
qtensor
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
3
>
QuadraturePlanar
::
int_N_scalar_NT_dV
(
const
xt
::
xtensor
<
double
,
2
>
&
qscalar
)
const
{
xt
::
xtensor
<
double
,
3
>
elemmat
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nne
*
m_ndim
,
m_nne
*
m_ndim
});
this
->
int_N_scalar_NT_dV
(
qscalar
,
elemmat
);
return
elemmat
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
3
>
QuadraturePlanar
::
int_gradN_dot_tensor2_dV
(
const
xt
::
xtensor
<
double
,
4
>
&
qtensor
)
const
{
xt
::
xtensor
<
double
,
3
>
elemvec
=
xt
::
empty
<
double
>
({
m_nelem
,
m_nne
,
m_ndim
});
this
->
int_gradN_dot_tensor2_dV
(
qtensor
,
elemvec
);
return
elemvec
;
}
// -------------------------------------------------------------------------------------------------
inline
xt
::
xtensor
<
double
,
3
>
QuadraturePlanar
::
int_gradN_dot_tensor4_dot_gradNT_dV
(
const
xt
::
xtensor
<
double
,
6
>
&
qtensor
)
const
{
xt
::
xtensor
<
double
,
3
>
elemmat
=
xt
::
empty
<
double
>
({
m_nelem
,
m_ndim
*
m_nne
,
m_ndim
*
m_nne
});
this
->
int_gradN_dot_tensor4_dot_gradNT_dV
(
qtensor
,
elemmat
);
return
elemmat
;
}
// -------------------------------------------------------------------------------------------------
}}}
// namespace ...
// =================================================================================================
#endif
Event Timeline
Log In to Comment