Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
gmsh
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Larry Price
gmsh
Commits
ea8d719e
"README.txt" did not exist on "53f7e70930d3d1469e4e20a0d05f25a1611e6bd9"
Commit
ea8d719e
authored
13 years ago
by
Van Dung Nguyen
Browse files
Options
Downloads
Patches
Plain Diff
add third derivatives of shape function
parent
4a6c3130
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Numeric/polynomialBasis.h
+143
-1
143 additions, 1 deletion
Numeric/polynomialBasis.h
with
143 additions
and
1 deletion
Numeric/polynomialBasis.h
+
143
−
1
View file @
ea8d719e
...
@@ -75,7 +75,7 @@ class polynomialBasis
...
@@ -75,7 +75,7 @@ class polynomialBasis
int
type
,
parentType
,
order
,
dimension
;
int
type
,
parentType
,
order
,
dimension
;
bool
serendip
;
bool
serendip
;
class
closure
:
public
std
::
vector
<
int
>
{
class
closure
:
public
std
::
vector
<
int
>
{
public:
public:
int
type
;
int
type
;
};
};
typedef
std
::
vector
<
closure
>
clCont
;
typedef
std
::
vector
<
closure
>
clCont
;
...
@@ -304,6 +304,148 @@ class polynomialBasis
...
@@ -304,6 +304,148 @@ class polynomialBasis
break
;
break
;
}
}
}
}
inline
void
dddf
(
double
u
,
double
v
,
double
w
,
double
third
[][
3
][
3
][
3
])
const
{
switch
(
monomials
.
size2
())
{
case
1
:
for
(
int
i
=
0
;
i
<
coefficients
.
size1
();
i
++
){
for
(
int
p
=
0
;
p
<
3
;
p
++
)
for
(
int
q
=
0
;
q
<
3
;
q
++
)
for
(
int
r
=
0
;
r
<
3
;
r
++
)
third
[
i
][
p
][
q
][
r
]
=
0.
;
for
(
int
j
=
0
;
j
<
coefficients
.
size2
();
j
++
){
if
(
monomials
(
j
,
0
)
>
2
)
// third derivative !=0
third
[
i
][
0
][
0
][
0
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)(
monomials
(
j
,
0
)
-
3
))
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
(
monomials
(
j
,
0
)
-
2
);
}
}
break
;
case
2
:
for
(
int
i
=
0
;
i
<
coefficients
.
size1
();
i
++
){
for
(
int
p
=
0
;
p
<
3
;
p
++
)
for
(
int
q
=
0
;
q
<
3
;
q
++
)
for
(
int
r
=
0
;
r
<
3
;
r
++
)
third
[
i
][
p
][
q
][
r
]
=
0.
;
for
(
int
j
=
0
;
j
<
coefficients
.
size2
();
j
++
){
if
(
monomials
(
j
,
0
)
>
2
)
// second derivative !=0
third
[
i
][
0
][
0
][
0
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)(
monomials
(
j
,
0
)
-
3
))
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
(
monomials
(
j
,
0
)
-
2
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
));
if
((
monomials
(
j
,
0
)
>
1
)
&&
(
monomials
(
j
,
1
)
>
0
))
third
[
i
][
0
][
0
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
2
)
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
1
)
*
monomials
(
j
,
1
);
if
((
monomials
(
j
,
0
)
>
0
)
&&
(
monomials
(
j
,
1
)
>
1
))
third
[
i
][
0
][
1
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
1
)
*
monomials
(
j
,
0
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
2
)
*
monomials
(
j
,
1
)
*
(
monomials
(
j
,
1
)
-
1
);
if
(
monomials
(
j
,
1
)
>
2
)
third
[
i
][
1
][
1
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
))
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
3
)
*
monomials
(
j
,
1
)
*
(
monomials
(
j
,
1
)
-
1
)
*
(
monomials
(
j
,
1
)
-
2
);
}
third
[
i
][
0
][
1
][
0
]
=
third
[
i
][
0
][
0
][
1
];
third
[
i
][
1
][
0
][
0
]
=
third
[
i
][
0
][
0
][
1
];
third
[
i
][
1
][
0
][
1
]
=
third
[
i
][
0
][
1
][
1
];
third
[
i
][
1
][
1
][
0
]
=
third
[
i
][
0
][
1
][
1
];
}
break
;
case
3
:
for
(
int
i
=
0
;
i
<
coefficients
.
size1
();
i
++
){
for
(
int
p
=
0
;
p
<
3
;
p
++
)
for
(
int
q
=
0
;
q
<
3
;
q
++
)
for
(
int
r
=
0
;
r
<
3
;
r
++
)
third
[
i
][
p
][
q
][
r
]
=
0.
;
for
(
int
j
=
0
;
j
<
coefficients
.
size2
();
j
++
){
if
(
monomials
(
j
,
0
)
>
2
)
// second derivative !=0
third
[
i
][
0
][
0
][
0
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)(
monomials
(
j
,
0
)
-
3
))
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
(
monomials
(
j
,
0
)
-
2
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
))
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
));
if
((
monomials
(
j
,
0
)
>
1
)
&&
(
monomials
(
j
,
1
)
>
0
))
third
[
i
][
0
][
0
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
2
)
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
1
)
*
monomials
(
j
,
1
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
));
if
((
monomials
(
j
,
0
)
>
1
)
&&
(
monomials
(
j
,
2
)
>
0
))
third
[
i
][
0
][
0
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
2
)
*
monomials
(
j
,
0
)
*
(
monomials
(
j
,
0
)
-
1
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
))
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
1
)
*
monomials
(
j
,
2
);
if
((
monomials
(
j
,
0
)
>
0
)
&&
(
monomials
(
j
,
1
)
>
1
))
third
[
i
][
0
][
1
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
1
)
*
monomials
(
j
,
0
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
2
)
*
monomials
(
j
,
1
)
*
(
monomials
(
j
,
1
)
-
1
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
));
if
((
monomials
(
j
,
0
)
>
0
)
&&
(
monomials
(
j
,
1
)
>
0
)
&&
(
monomials
(
j
,
2
)
>
0
))
third
[
i
][
0
][
1
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
1
)
*
monomials
(
j
,
0
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
1
)
*
monomials
(
j
,
1
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
1
)
*
monomials
(
j
,
2
);
if
((
monomials
(
j
,
0
)
>
0
)
&&
(
monomials
(
j
,
2
)
>
1
))
third
[
i
][
0
][
2
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
)
-
1
)
*
monomials
(
j
,
0
)
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
))
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
2
)
*
monomials
(
j
,
2
)
*
(
monomials
(
j
,
2
)
-
1
);
if
((
monomials
(
j
,
1
)
>
2
))
third
[
i
][
1
][
1
][
1
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
))
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
3
)
*
monomials
(
j
,
1
)
*
(
monomials
(
j
,
1
)
-
1
)
*
(
monomials
(
j
,
1
)
-
2
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
));
if
((
monomials
(
j
,
1
)
>
1
)
&&
(
monomials
(
j
,
2
)
>
0
))
third
[
i
][
1
][
1
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
))
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
2
)
*
monomials
(
j
,
1
)
*
(
monomials
(
j
,
1
)
-
1
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
1
)
*
monomials
(
j
,
2
)
;
if
((
monomials
(
j
,
1
)
>
0
)
&&
(
monomials
(
j
,
2
)
>
1
))
third
[
i
][
1
][
2
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
))
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
)
-
1
)
*
monomials
(
j
,
1
)
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
2
)
*
monomials
(
j
,
2
)
*
(
monomials
(
j
,
2
)
-
1
)
;
if
((
monomials
(
j
,
2
)
>
2
))
third
[
i
][
2
][
2
][
2
]
+=
coefficients
(
i
,
j
)
*
pow_int
(
u
,
(
int
)
monomials
(
j
,
0
))
*
pow_int
(
v
,
(
int
)
monomials
(
j
,
1
))
*
pow_int
(
w
,
(
int
)
monomials
(
j
,
2
)
-
3
)
*
monomials
(
j
,
2
)
*
(
monomials
(
j
,
2
)
-
1
)
*
(
monomials
(
j
,
2
)
-
2
);
}
third
[
i
][
0
][
1
][
0
]
=
third
[
i
][
0
][
0
][
1
];
third
[
i
][
1
][
0
][
0
]
=
third
[
i
][
0
][
0
][
1
];
third
[
i
][
2
][
0
][
0
]
=
third
[
i
][
0
][
0
][
2
];
third
[
i
][
0
][
2
][
0
]
=
third
[
i
][
0
][
0
][
2
];
third
[
i
][
1
][
0
][
1
]
=
third
[
i
][
0
][
1
][
1
];
third
[
i
][
1
][
1
][
0
]
=
third
[
i
][
0
][
1
][
1
];
third
[
i
][
0
][
2
][
1
]
=
third
[
i
][
0
][
1
][
2
];
third
[
i
][
1
][
0
][
2
]
=
third
[
i
][
0
][
1
][
2
];
third
[
i
][
1
][
2
][
0
]
=
third
[
i
][
0
][
1
][
2
];
third
[
i
][
2
][
1
][
0
]
=
third
[
i
][
0
][
1
][
2
];
third
[
i
][
2
][
0
][
1
]
=
third
[
i
][
0
][
1
][
2
];
third
[
i
][
2
][
2
][
0
]
=
third
[
i
][
0
][
2
][
2
];
third
[
i
][
2
][
0
][
2
]
=
third
[
i
][
0
][
2
][
2
];
third
[
i
][
1
][
2
][
1
]
=
third
[
i
][
1
][
1
][
2
];
third
[
i
][
2
][
1
][
1
]
=
third
[
i
][
1
][
1
][
2
];
third
[
i
][
2
][
2
][
1
]
=
third
[
i
][
1
][
2
][
2
];
third
[
i
][
2
][
1
][
2
]
=
third
[
i
][
1
][
2
][
2
];
}
break
;
}
}
static
int
getTag
(
int
parentTag
,
int
order
,
bool
serendip
=
false
);
static
int
getTag
(
int
parentTag
,
int
order
,
bool
serendip
=
false
);
};
};
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment
