Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
pystencils
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
Package registry
Model registry
Operate
Environments
Terraform modules
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
hyteg
pystencils
Commits
cfa9ec1d
Commit
cfa9ec1d
authored
5 years ago
by
Michael Kuron
Browse files
Options
Downloads
Patches
Plain Diff
FVM derivation: use a smaller stencil before trying brute-force to find the sparsest stencil
parent
0bb88bca
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
pystencils/fd/finitevolumes.py
+28
-23
28 additions, 23 deletions
pystencils/fd/finitevolumes.py
with
28 additions
and
23 deletions
pystencils/fd/finitevolumes.py
+
28
−
23
View file @
cfa9ec1d
...
@@ -123,30 +123,35 @@ class FVM1stOrder:
...
@@ -123,30 +123,35 @@ class FVM1stOrder:
else
:
else
:
stencil
=
[
""
.
join
(
a
).
replace
(
"
"
,
""
)
for
a
in
itertools
.
product
(
"
NS
"
,
"
EW
"
,
"
TB
"
)
stencil
=
[
""
.
join
(
a
).
replace
(
"
"
,
""
)
for
a
in
itertools
.
product
(
"
NS
"
,
"
EW
"
,
"
TB
"
)
if
""
.
join
(
a
).
strip
()]
if
""
.
join
(
a
).
strip
()]
stencil
=
[
tuple
(
ps
.
stencil
.
direction_string_to_offset
(
d
,
self
.
dim
))
for
d
in
stencil
]
weights
=
None
for
stencil
in
[[
"
N
"
,
"
S
"
,
"
E
"
,
"
W
"
,
"
T
"
,
"
B
"
][:
2
*
self
.
dim
],
stencil
]:
derivation
=
FD
(
direction
,
stencil
).
get_stencil
()
stencil
=
[
tuple
(
ps
.
stencil
.
direction_string_to_offset
(
d
,
self
.
dim
))
for
d
in
stencil
]
if
not
derivation
.
accuracy
:
derivation
=
FD
(
direction
,
stencil
).
get_stencil
()
if
not
derivation
.
accuracy
:
continue
weights
=
derivation
.
weights
# if the weights are underdefined, we can choose the free symbols to find the sparsest stencil
free_weights
=
set
(
itertools
.
chain
(
*
[
w
.
free_symbols
for
w
in
weights
]))
if
len
(
free_weights
)
>
0
:
zero_counts
=
defaultdict
(
list
)
for
values
in
itertools
.
product
([
-
1
,
-
sp
.
Rational
(
1
,
2
),
0
,
1
,
sp
.
Rational
(
1
,
2
)],
repeat
=
len
(
free_weights
)):
subs
=
{
free_weight
:
value
for
free_weight
,
value
in
zip
(
free_weights
,
values
)}
weights
=
[
w
.
subs
(
subs
)
for
w
in
derivation
.
weights
]
if
not
all
(
a
==
0
for
a
in
weights
):
zero_count
=
sum
([
1
for
w
in
weights
if
w
==
0
])
zero_counts
[
zero_count
].
append
(
weights
)
best
=
zero_counts
[
max
(
zero_counts
.
keys
())]
if
len
(
best
)
>
1
:
raise
NotImplementedError
(
"
more than one suitable set of weights found,
"
"
don
'
t know how to proceed
"
)
weights
=
best
[
0
]
break
if
not
weights
:
raise
Exception
(
'
the requested derivative cannot be performed with the available neighbors
'
)
raise
Exception
(
'
the requested derivative cannot be performed with the available neighbors
'
)
weights
=
derivation
.
weights
assert
weights
# if the weights are underdefined, we can choose the free symbols to find the sparsest stencil
free_weights
=
set
(
itertools
.
chain
(
*
[
w
.
free_symbols
for
w
in
weights
]))
if
len
(
free_weights
)
>
0
:
zero_counts
=
defaultdict
(
list
)
for
values
in
itertools
.
product
([
-
1
,
-
sp
.
Rational
(
1
,
2
),
0
,
1
,
sp
.
Rational
(
1
,
2
)],
repeat
=
len
(
free_weights
)):
subs
=
{
free_weight
:
value
for
free_weight
,
value
in
zip
(
free_weights
,
values
)}
weights
=
[
w
.
subs
(
subs
)
for
w
in
derivation
.
weights
]
if
not
all
(
a
==
0
for
a
in
weights
):
zero_count
=
sum
([
1
for
w
in
weights
if
w
==
0
])
zero_counts
[
zero_count
].
append
(
weights
)
best
=
zero_counts
[
max
(
zero_counts
.
keys
())]
if
len
(
best
)
>
1
:
raise
NotImplementedError
(
"
more than one suitable set of weights found,
"
"
don
'
t know how to proceed
"
)
weights
=
best
[
0
]
assert
weights
if
access
.
_field
.
index_dimensions
==
0
:
if
access
.
_field
.
index_dimensions
==
0
:
return
sum
([
access
.
_field
.
__getitem__
(
point
)
*
weight
for
point
,
weight
in
zip
(
stencil
,
weights
)])
return
sum
([
access
.
_field
.
__getitem__
(
point
)
*
weight
for
point
,
weight
in
zip
(
stencil
,
weights
)])
...
...
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