27 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
28 for (
unsigned int eqn=0; eqn<neqn; eqn++) {
30 du[qp*neqn+eqn] = 0.0;
31 for (
unsigned int node=0; node<e->
nnode; node++) {
32 u[qp*neqn+eqn] += x[node*neqn+eqn] * e->
phi[qp][node];
33 du[qp*neqn+eqn] += x[node*neqn+eqn] * e->
dphi[qp][node];
39 double *s = malloc(e->
nqp*
sizeof(
double));
40 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
42 for (
unsigned int eqn=0; eqn<neqn; eqn++)
43 s[qp] += u[qp*neqn+eqn]*u[qp*neqn+eqn];
47 for (
unsigned int node=0; node<e->
nnode; node++) {
48 for (
unsigned int eqn=0; eqn<neqn; eqn++) {
49 unsigned int row = node*neqn+eqn;
51 for (
unsigned int qp=0; qp<e->
nqp; qp++) {
53 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)