18 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
19 for (
unsigned int eqn=0; eqn<neqn; eqn++) {
21 du[qp*neqn+eqn] = 0.0;
22 for (
unsigned int node=0; node<e->
nnode; node++) {
23 u[qp*neqn+eqn] += x[node*neqn+eqn] * e->
phi[qp][node];
24 du[qp*neqn+eqn] += x[node*neqn+eqn] * e->
dphi[qp][node];
30 double *s = malloc(e->
nqp*
sizeof(
double));
31 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
33 for (
unsigned int eqn=0; eqn<neqn; eqn++)
34 s[qp] += u[qp*neqn+eqn]*u[qp*neqn+eqn];
38 for (
unsigned int node=0; node<e->
nnode; node++) {
39 for (
unsigned int eqn=0; eqn<neqn; eqn++) {
40 unsigned int row = node*neqn+eqn;
42 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
44 e->
w[qp]*e->
jac[qp]*(-e->
dphi[qp][node]/(e->
jac[qp]*e->
jac[qp])*du[qp*neqn+eqn] + e->
phi[qp][node]*s[qp]*
exp(u[qp*neqn+eqn]));
void adic_element_fill(ElemData *e, unsigned int neqn, const DERIV_TYPE *x, DERIV_TYPE *u, DERIV_TYPE *du, DERIV_TYPE *f)