Hi,
I am trying to profile my petsc code. Particularly I am trying to have a
graph dependance of processor.
Thank you for help me.
Guy
Hello,
I am trying to use MatILUDTFactor make an incomplete factorisation for
preconditionner.
I did not if it work correctly. In general case, when you reduce you drop
tolerance criteria your preconditionner become better, but I all example
that I use he dot not change. I dont know if I use it
Dear Tims,
MUMPS is direct solver so you do not need Krylov subspace which are
generally iterative solver.
May be you are using MUMPS as solver in you problem not as preconditionner.
Regards
Dear Matt
On Wed, 25 Jul 2007, Matthew Knepley wrote:
-ksp_type preonly
-pc_type lu
-mat_type
Dear Tim,
I affraid that you have same memory problem while using MUMPS. I have
observed same memory problem while trying to solve some 3D Stokes
equations with MUMPS. I think the better way to solve this type of problem
is KSP with appropriate PC.
Regards,
Guy
Dear Lisandro,
On Mon, 23 Jul
Dear Tims,
The problem is how to solve more accuretly the local problem in ASM. You
can also use KSP to solve local problem.
I think you can look how to do it with PCASMGetSubKSP().
Best Regards,
Guy
Dear gaatenek
On Mon, 23 Jul 2007, gaatenek at irisa.fr wrote:
Do you monitoring the
Hi,
I am trying to found the condition number of the factors L and U of sparse
matrix factorize by SuperLU in Petsc. The problem is that I not able to
manipulate the L and U factors in my code.
Please help me.
Regards
