On Fri, Oct 5, 2018 at 9:16 PM Mike Wick
wrote:
> Hi Hong:
>
> There is no explicit error message actually. The solver converge in 0
> iteration and returns an nan number. Looks like a zero pivoting problem.
>
> Mike
>
I use MatMumpsGetInfo
Hi Hong:
There is no explicit error message actually. The solver converge in 0
iteration and returns an nan number. Looks like a zero pivoting problem.
Mike
On Fri, Oct 5, 2018 at 6:12 PM Zhang, Hong wrote:
> Mike:
>
>> Hello PETSc team:
>>
>> I am trying to solve a PDE problem with
Mike:
Hello PETSc team:
I am trying to solve a PDE problem with high-order finite elements. The matrix
is getting denser and my experience is that MUMPS just outperforms iterative
solvers.
For certain problems, MUMPS just fail in the middle for no clear reason. I just
wander if there is any
Hello PETSc team:
I am trying to solve a PDE problem with high-order finite elements. The
matrix is getting denser and my experience is that MUMPS just outperforms
iterative solvers.
For certain problems, MUMPS just fail in the middle for no clear reason. I
just wander if there is any suggestion
Hello,
I'm trying to do a simple variable interpolation, from a cell center to a
face in a staggered grid, my model data management is done with DMDAs, with
two different DMs one for each cell position,
I already did this task on a fortran only version of the model using the 4
closest neighbors
Sorry again about the formatting - I struggle with notation in email.
I think I see what you are saying - my augmented matrix should differ in
the last row between the one used to calculate the nullspace, u, and the
one the SNES uses as the Jacobian. If I construct the SNES Jacobian A so
that u
Thanks Matt - I was trying to write it in linear algebra notation, but the
nature of the problem might produce some confusion. I was also originally
a bit confused by a fairly major typo in the paper I was following, but I'm
almost sure I have it clear now. I'll try to be concise - the meat is
> El 4 oct 2018, a las 19:54, Ale Foggia escribió:
>
> Jose:
> - By each step I mean each of the step of the the program in order to
> diagonalize the matrix. For me, those are: creation of basis, preallocation
> of matrix, setting values of matrix, initializing solver,
>
