Please run a case that breaks with LSQR using the option
-ksp_view_mat binary -ksp_view_rhs binary
and email to petsc-ma...@mcs.anl.gov the file called binaryoutput
Barry
> On Apr 12, 2018, at 2:50 PM, Ali Berk Kahraman
> wrote:
>
> In the very first e-mail, I have a scheme at h
So you want to have a parallel linear? solver and the rest of the code
including Jacobian generation sequential?
Barry
> On Apr 12, 2018, at 2:32 PM, Klaus Burkart wrote:
>
> Are your matrix entries stored in parallel or is your current code that
> generates the rows, columns, and valu
Are your matrix entries stored in parallel or is your current code that
generates the rows, columns, and values sequential.
Does your matrix have a pointwise-block structure (like from having multiple
degrees of freedom per grid point) or is it a scalar PDE? If scalar than you
use AIJ ma
I am confused with matrix object types and which one to use in my case:
I want to solve a linear system using multiple processes. The steps I am
struggling with is the import of the global matrix and global rhs vector into
applicable PETSc objects.
The global matrix is currently stored in CSR
Unfortunately I don't have a good answer for you.
The manual page for KSPCGNE says one should use KSPLSQR for least squares
problems. This one hopefully has the correct convergence test for inconsistent
systems built in. Please try this solver and let us know how it goes.
Barry
> On
> On Apr 12, 2018, at 10:56 AM, Ali Berk Kahraman
> wrote:
>
> How do I tell that to the KSP object? Is there a direct command or a function?
Tell the KSP object what?
What happens when you run with -ksp_monitor_true_residual ?
We may not have a good convergence test for this c
> On Apr 12, 2018, at 10:43 AM, Ali Berk Kahraman
> wrote:
>
> Dear Barry,
>
> Thank you very very much for your response.
>
> Unfortunately, I use finite differences on an unstructured grid, so my matrix
> is not symmetric.
>
> That is exactly why I want to know the null space, so I can r
> On Apr 12, 2018, at 3:47 PM, Satish Balay wrote:
>
> On Thu, 12 Apr 2018, Victor Eijkhout wrote:
>
>>
>>
>> On Apr 12, 2018, at 3:30 PM, Satish Balay
>> mailto:ba...@mcs.anl.gov>> wrote:
>>
>> I can reproudce this issue with 'icc (ICC) 18.0.2 20180210'. Is there a
>> newer version?
>>
>
I'm not familiar with that paper so I am not sure if it produces exactly the
same colorings. It is based on the same principle. The coloring is done in
/src/dm/impls/da/fdda.c DMCreateColoring_DA_3d_MPIAIJ() so you could compare.
Note if they have more efficient special cases in the paper th
A few thoughts,
> On Apr 12, 2018, at 7:47 AM, Ali Berk Kahraman
> wrote:
>
> Dear All,
>
> I am trying to solve a Poisson problem with a known source function with all
> Neumann BCs.
If you are using finite elements then the matrix should be symmetric and
hence its transpose nullsp
On Thu, 12 Apr 2018, Victor Eijkhout wrote:
>
>
> On Apr 12, 2018, at 3:30 PM, Satish Balay
> mailto:ba...@mcs.anl.gov>> wrote:
>
> I can reproudce this issue with 'icc (ICC) 18.0.2 20180210'. Is there a newer
> version?
>
> Probably not. But I can’t figure out Intel version numbers. Here’s
On Apr 12, 2018, at 3:30 PM, Satish Balay
mailto:ba...@mcs.anl.gov>> wrote:
I can reproudce this issue with 'icc (ICC) 18.0.2 20180210'. Is there a newer
version?
Probably not. But I can’t figure out Intel version numbers. Here’s what I find:
compilers_and_libraries_2018.2.199/
Victor.
On Thu, 12 Apr 2018, Victor Eijkhout wrote:
>
>
> > On Apr 11, 2018, at 9:12 AM, Randall Mackie wrote:
> >
> > Hi Satish,
> >
> > Thanks to you and Jeff for taking a look at this. We will submit a bug
> > report to Intel.
>
> Intel has released 18 update 2 which seems to fix several of thes
Dear all,
When I use -snes_fd_color with my da created by DMDACreate3d, will it use an
optimal coloring algorithm (see [1]) to estimate the Jacobian?
Thank you!
Henrik
[1]
Goldfarb/Toint: Optimal estimation of Jacobian and Hessian matrices that arise
in finite difference calculations
https:/
14 matches
Mail list logo
