-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Addition of multiplierFESpace #37
Conversation
… remains to be done
Benchmark resultJudge resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsA ratio greater than
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfoTarget
Baseline
Target resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Baseline resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Runtime information
|
Benchmark Results
Benchmark PlotsA plot of the benchmark results have been uploaded as an artifact to the workflow run for this PR. |
src/fespace/fespace.jl
Outdated
for i in 1:size | ||
offset[:, i] .= i - 1 | ||
end | ||
ndofs = ones(ncells(mesh), size) # Temporary allocation for development purposes |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can you remove the comment since it seems that we finally kept this line
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I suggest to update this comment: "TODO : use a Fill
array to save memory space"
src/assembler/assembler.jl
Outdated
@@ -456,6 +456,20 @@ function _count_n_elts( | |||
return n | |||
end | |||
|
|||
""" |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can you please merge the three _count_n_elts
doc strings into a unique one, located at the top of the first method declaration? Take a look at src/fespace/fespace.jl
-> TrialFESpace
constructor for inspiration.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We need some unit tests, especially on the dofhandler for the MultiplierFESpace. Maybe some tests taken from the tutorial configuration?
Moreover, a "global" test like Ghislain did for the DG Poisson would be nice. We can do it together during a live session.
Thanks for the review. I added a few unit tests for MultiplierFESpace. Concerning the "global" test, did you mean a test at the end of the corresponding example (with the error computation)? |
Benchmark resultJudge resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsA ratio greater than
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfoTarget
Baseline
Target resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Baseline resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Runtime information
|
I meant encapsulating your whole example (or a simplified version) into a Bcube.jl/test/dof/test_assembler.jl Line 213 in d81437d
|
Benchmark resultJudge resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsA ratio greater than
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfoTarget
Baseline
Target resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Baseline resultBenchmark Report for /home/runner/work/Bcube.jl/Bcube.jlJob Properties
ResultsBelow is a table of this job's results, obtained by running the benchmarks.
Benchmark Group ListHere's a list of all the benchmark groups executed by this job:
Julia versioninfo
Runtime information
|
src/fespace/fespace.jl
Outdated
for i in 1:size | ||
offset[:, i] .= i - 1 | ||
end | ||
ndofs = ones(ncells(mesh), size) # Temporary allocation for development purposes |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Ones
or Fill
from FillArrays.jl
could be considered
src/fespace/fespace.jl
Outdated
for i in 1:size | ||
offset[:, i] .= i - 1 | ||
end | ||
ndofs = ones(ncells(mesh), size) # Temporary allocation for development purposes |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I suggest to update this comment: "TODO : use a Fill
array to save memory space"
This PR introduces a first development of MultiplierFESpace for the solution of constrained minimization problems. The idea is to be able to construct a MultiFESpace combining the usual finite element discretization on the one hand and Lagrange multipliers on the other. Here the Lagrange multipliers are additional unknowns and the MultiFESpace combined with MultiplierFESpace enables to assemble a global system which yields the solution of the constrained minimization problem as well as the associated Lagrange multipliers. The development is built on the constrained Poisson example.