Thanks Barry,
I am going to take a try.
Fande,
On Thu, Sep 20, 2018 at 2:15 PM Smith, Barry F. wrote:
>
> Not a priority for us but if you implement clean code to do this we're
> likely to accept it.
>
>Barry
>
>
> > On Sep 20, 2018, at 12:27 PM, Fande Kong wrote:
> >
> > Hi
Brian,
I have finished making the (relatively few) changes needed to get PETSc's
GAMG to run on a combination of the CPU and GPU. Any of the AMG kernels that
has a CUDA backed is run automatically on the GPU while the kernels without a
CUDA backend are run on the CPU. In particular
Not a priority for us but if you implement clean code to do this we're likely
to accept it.
Barry
> On Sep 20, 2018, at 12:27 PM, Fande Kong wrote:
>
> Hi Developers,
>
> MATBAIJ actually assumes that the point-block is dense. It is fine if the
> block size is small for example less
In order to make the discussion simple, we can just assume the sparse block
is a diagonal matrix. How to take the advantage of the diagonal block
matrix?
Fande,
On Thu, Sep 20, 2018 at 12:28 PM Fande Kong wrote:
>
>
> On Thu, Sep 20, 2018 at 12:09 PM Matthew Knepley
> wrote:
>
>> On Thu, Sep
On Thu, Sep 20, 2018 at 12:09 PM Matthew Knepley wrote:
> On Thu, Sep 20, 2018 at 1:26 PM Fande Kong wrote:
>
>> Hi Developers,
>>
>> MATBAIJ actually assumes that the point-block is dense. It is fine if the
>> block size is small for example less than 50, but we may suffer from a
>> memory
On Thu, Sep 20, 2018 at 1:26 PM Fande Kong wrote:
> Hi Developers,
>
> MATBAIJ actually assumes that the point-block is dense. It is fine if the
> block size is small for example less than 50, but we may suffer from a
> memory issue if the block is large such as 1000. The block is not necessary
Hi Developers,
MATBAIJ actually assumes that the point-block is dense. It is fine if the
block size is small for example less than 50, but we may suffer from a
memory issue if the block is large such as 1000. The block is not necessary
dense. In my application, neutron transport equations, the
"Smith, Barry F." writes:
> Problem 2) Less catastrophic
>
> When cheb->kspest is set the "regular" Chebyshev is also run (after the
> eigenvalues are estimated). I am pretty sure this is wrong because there is
> no reason to run the Chebyshev when estimating the eigenvalues? The
>
Mark,
Thanks for the explanation, I totally missed the
> if (amatid != cheb->amatid || pmatid != cheb->pmatid || amatstate !=
> cheb->amatstate || pmatstate != cheb->pmatstate) {
code that insures the computation of the eigenvalues is only once on each new
matrix.
Sorry for the
2018-09-20 12:00 GMT+02:00 Mark Adams :
>
>
> On Wed, Sep 19, 2018 at 7:44 PM Smith, Barry F.
> wrote:
>
>>
>> Look at the code in KSPSolve_Chebyshev().
>>
>> Problem 1) VERY MAJOR
>>
>> Once you start running the eigenestimates it always runs them, this
>> is because the routine begins
On Wed, Sep 19, 2018 at 7:44 PM Smith, Barry F. wrote:
>
> Look at the code in KSPSolve_Chebyshev().
>
> Problem 1) VERY MAJOR
>
> Once you start running the eigenestimates it always runs them, this is
> because the routine begins with
>
> if (cheb->kspest) {
>
>but once
Hello,
thank you a lot. Yesterday, I finished first version of OpenCV build script.
Barry, thanks for you remark, however OpenCV should be compiled without
dependency on OpenCL as well as CUDA etc. First version of OpenCV viewer, I am
going to implement without OpenCL dependency. I’ve decided
12 matches
Mail list logo
