On 10/9/19 10:26 AM, Matteo Frigo wrote: > > I'm saying that making a DynamicSparsityPattern by using the procedure > described above is more expensive (from the memory point of view) respect > using TrilinosWrappers::BlockSparsityPattern. > I noted this trouble trying to run some test cases with a large number of > unknowns (100 millions of dofs). > In such cases, I get an out of memory error if I use DynamicSparsityPattern, > whereas it works fine using TrilinosWrappers::BlockSparsityPattern. > Investigating on smaller cases, I noted that a peak of memory usage occurs > during the call of the function: > DoFTools::make_sparsity_pattern(dof_handler, scratch_coupling, dsp, > constraints, false, this_mpi_process); > It means that the problem remains, even if the program runs until the end. > As far as the analysis of memory consumption is concerned, I used the Massif > tool from Valgrind.
Matteo, thanks for clarifying. It would still be really nice if you could create a small program that really just builds a mesh, a DoFhandler, and then the sparsity pattern with both ways -- this would make it easier for us to figure out what is going on! Best W. -- ------------------------------------------------------------------------ Wolfgang Bangerth email: [email protected] www: http://www.math.colostate.edu/~bangerth/ -- The deal.II project is located at http://www.dealii.org/ For mailing list/forum options, see https://groups.google.com/d/forum/dealii?hl=en --- You received this message because you are subscribed to the Google Groups "deal.II User Group" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/9a02c6b1-3ce2-02b7-6db8-0c05e4102702%40colostate.edu.
