Dustin,
2016-09-07 11:07 GMT-04:00 Dustin Kumor :
> I'm using the function "add_entries" only in combination with the
> DynamicSparsityPattern and not with the SparsityPattern class. Moreover, it
> seems that the DynamicSparsityPattern class doesn't even have a "copy_form"
Dear Martin, dear Bruno,
I'm sorry for giving a feedback to your answers that late, but I have been
really busy with another project and had no time to deal with this problem.
@Martin: After applying the patch I get the same run time results as you
did. So thank you for figuring out and fixing
Hi Dustin,
Thanks for your file. This is indeed a bug in deal.II. Our algorithms
for copying the sparsity pattern contain a part that scales
quadratically in the number of rows in case most of the rows are empty,
as is the case with some of your sparsity patterns. This is very bad if
there
Dear all,
some additional information. Out of interest I switched back to the last
release version of the deal.ii library 8.4.1 and made a run with this
version. The problem is still there and even worse. I attached again the
two log files for debug and release mode respectively.
Best
Dustin
Dear Martin,
the update to the most recent development version solved the problem. Now
time needed to finish the copy operation is in the expected range. Thanks a
lot for your support.
Best,
Dustin
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options,
Dear Martin,
I'm using 8.5.0-pre. But I haven't updated the code for a long time. I will
do this first, then compile the library again and let you know about the
results.
Best,
Dustin
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
Dear Dustin,
I had a look at your program on my machine with the most recent
development version of deal.II. Here is the final timer output in
release mode:
+-+++
| Total wallclock time elapsed since start| 1.02s |
Dear Martin,
after one week on a conference and two additional weeks on holidays I am
finally back in office and realised the test case. I attached the file to
the post and also log files for runs for both in Debug and Release mode.
You can call DynamicSparsityPattern::n_nonzero_elements() to
Dear Dustin,
How is your computational setup, i.e., how many nonzero entries do
you have in your matrix?
I'm not sure if I understand what you mean. Do you mean the number of
nonzero entries in /SparseMatrix/ or in the /BlockSparsityPattern/ or
in the dynamic one? How can I get this
Dear Martin,
thank you for answering that quickly.
How is your computational setup, i.e., how many nonzero entries do you have
> in your matrix?
>
I'm not sure if I understand what you mean. Do you mean the number of
nonzero entries in *SparseMatrix* or in the *BlockSparsityPattern* or in
Dear Dustin,
With regard to a lot of tutorial programms I would say that this is
the usual way to work with /DynamicSparsityPatterns/, isn't it?
Yes, the description you give is exactly the way I would choose for the
sparsity pattern.
So back to the question. Running the program the copy
11 matches
Mail list logo