> On May 16, 2019, at 8:04 PM, Sajid Ali
> wrote:
>
> While there is a ~3.5X speedup, deleting the aforementioned 20 lines also
> leads the new version of petsc to give the wrong solution (off by orders of
> magnitude for the same program).
Ok, sorry about this. Unfortunately this
Hi Sajid,
Can you please try this branch hongzh/fix-computejacobian quickly and see if it
makes a difference?
Thanks,
Hong (Mr.)
On May 16, 2019, at 8:04 PM, Sajid Ali via petsc-users
mailto:petsc-users@mcs.anl.gov>> wrote:
While there is a ~3.5X speedup, deleting the aforementioned 20 lines
While there is a ~3.5X speedup, deleting the aforementioned 20 lines also
leads the new version of petsc to give the wrong solution (off by orders of
magnitude for the same program).
I tried switching over the the IFunction/IJacobian interface as per the
manual (page 146) which the following
Hi Barry,
Thanks a lot for pointing this out. I'm seeing ~3X speedup in time !
Attached are the new log files. Does everything look right ?
Thank You,
Sajid Ali
Applied Physics
Northwestern University
out_50
Description: Binary data
out_100
Description: Binary data
Ok, got it. My misinterpretation was how to fill the d_nnz and o_nnz arrays.
Thank you for your help!
Might I make a suggestion related to the documentation? Perhaps I have not
fully read the page on the MatMPIBAIJSetPreallocation so you can simply
disregard and I'm ok with that! The
Barry:
Thanks for the quick response!
Running with -info gives nearly the same # of mallocs whether I "prealloc" or
not. I'll bet I'm doing something wrong with the preallocation. I must know the
matrix structure since convergence is really good with SNES.
I should have 9232128 total non
> On May 16, 2019, at 3:44 PM, William Coirier via petsc-users
> wrote:
>
> Folks:
>
> I'm developing an application using the SNES, and overall it's working great,
> as many of our other PETSc-based projects. But, I'm having a problem related
> to (presumably) pre-allocation, block
Sajid,
This is a huge embarrassing performance bug in PETSc
https://bitbucket.org/petsc/petsc/issues/293/refactoring-of-ts-handling-of-reuse-of
It is using 74 percent of the time to perform MatAXPY() on two large sparse
matrices, not knowing they have identical nonzero patterns and
Hi PETSc developers,
I have a question about TSComputeRHSJacobianConstant. If I create a TS (of
type linear) for a problem where the jacobian does not change with time
(set with the aforementioned option) and run it for different number of
time steps, why does the time it takes to evaluate the
