On Tue, Sep 15, 2015 at 9:05 PM, Adrian Croucher
wrote:
> hi
>
> I have a test code (attached) that sets up a finite volume mesh using
> DMPlex, with 2 degrees of freedom per cell.
>
> I then create a matrix using DMCreateMatrix(), having used DMSetMatType()
> to set
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 16/09/15 12:40, Matthew Knepley wrote:
> On Tue, Sep 15, 2015 at 9:05 PM, Adrian Croucher
> >
> wrote:
>
> hi
>
> I have a test code (attached) that sets up a finite volume mesh
>
On Wed, Sep 16, 2015 at 7:18 AM, Lawrence Mitchell <
lawrence.mitch...@imperial.ac.uk> wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On 16/09/15 12:40, Matthew Knepley wrote:
> > On Tue, Sep 15, 2015 at 9:05 PM, Adrian Croucher
> >
Hi all,
I've built a MOOSE application and the problem I'm studying solves great
using serial LU. However, when I try to solve in parallel using super
LU, I encounter many DIVERGED_LINE_SEARCH errors using the default bt
line search. If I switch to line_search=none, then instead of
On Wed, Sep 16, 2015 at 8:28 AM, Alexander Lindsay
wrote:
> Hi all,
>
> I've built a MOOSE application and the problem I'm studying solves great
> using serial LU. However, when I try to solve in parallel using super LU, I
> encounter many DIVERGED_LINE_SEARCH errors using the
> El 16/9/2015, a las 21:09, Xujun Zhao escribió:
>
> Hi all,
>
> I am solving a max/min eigenvalue problem, and call EPSGetIterationNumber()
> to get the iteration number for convergence. However, it always returns 1.
> This is a little confused, because I can see my
Bikash:
>
>
> I have sparse matrix of MATMPIAIJ format that needs to be multiplied with
> a series of vectors and the resultant set of vectors are to be stored into
> a matrix. I can do that in two ways:
>
> 1. Perform series of MatMult operations and store the resultant vectors in
> a MATMPIDENSE
Hi all,
I am solving a max/min eigenvalue problem, and call EPSGetIterationNumber()
to get the iteration number for convergence. However, it always returns 1.
This is a little confused, because I can see my subroutine of MATOP_MULT
operation has been called 6 or 16 times with different
The following is another test, which shows the outer iteration is 2, and
MatMult is performed 24 times. So it means the first outer iteration
performs 16, and the subsequent iterations performs 8. (24=16+8)
What parameters can I tune to accelerate the convergence? Will changing ncv
work better?
Hi,
I have sparse matrix of MATMPIAIJ format that needs to be multiplied with a
series of vectors and the resultant set of vectors are to be stored into a
matrix. I can do that in two ways:
1. Perform series of MatMult operations and store the resultant vectors in
a MATMPIDENSE matrix; or
2.
> El 16/9/2015, a las 21:44, Xujun Zhao escribió:
>
> The following is another test, which shows the outer iteration is 2, and
> MatMult is performed 24 times. So it means the first outer iteration performs
> 16, and the subsequent iterations performs 8. (24=16+8)
>
> What
Thanks a lot, Hong.
On Wed, Sep 16, 2015 at 4:05 PM, Hong wrote:
> Bikash:
>>
>>
>> I have sparse matrix of MATMPIAIJ format that needs to be multiplied with
>> a series of vectors and the resultant set of vectors are to be stored into
>> a matrix. I can do that in two ways:
> On Sep 16, 2015, at 8:28 AM, Alexander Lindsay wrote:
>
> Hi all,
>
> I've built a MOOSE application and the problem I'm studying solves great
> using serial LU. However, when I try to solve in parallel using super LU, I
> encounter many DIVERGED_LINE_SEARCH errors using
13 matches
Mail list logo