Thank you Marc for your input,
Maybe I am just complicating things.
If I ever make a good example/module in the future, I'll make sure to share
it to the code gallery.
On Monday, December 5, 2022 at 1:11:14 AM UTC+2 mafe...@gmail.com wrote:
> Hello Abbas,
>
> if you are willing the share your
Hej,
I've written here before and hope I don't misuse the mailing list - however
I've been looking a bit in the documentation and here and haven't really
found a conclusive answer.
I am aiming to solve a nonlinear hyperbolic transport equation. For the
sake of the argument, let's say it reads
I am a bit surprised that your assembly is really 100x more expensive than
your linear solver.
Maybe your assembly code is not optimized?
For example, I try to avoid doing as much work as possible during the
double loop over DOFs which is the inner most loop. Sometimes
pre-calculating things in
On 12/8/22 12:13, blais...@gmail.com wrote:
For example, I try to avoid doing as much work as possible during the
double loop over DOFs which is the inner most loop. Sometimes
pre-calculating things in the outer loop really speeds-up the
calculation. This also depends on the polynomials you are
Kev,
I've done some layman's benchmarking of the individual "steps" (setup,
assembly, solve, ...) in my current version of the code. It looks as if the
assembly takes several orders of magnitude (~100 at least) longer than the
solving part.
My question is now: What is the best strategy to
Dear all,
I hope you are well.
I know that P4est as a partitioner has limitations compared to other
approaches like Metis or Scotch. However, I was wondering if there was
anyway to penalize the partitioner in order to generate the smaller valence
that is possible? Sometimes we end up with inter
On 12/8/22 14:46, blais...@gmail.com wrote:
I know that P4est as a partitioner has limitations compared to other
approaches like Metis or Scotch. However, I was wondering if there was anyway
to penalize the partitioner in order to generate the smaller valence that is
possible? Sometimes we en
