On Wed, Sep 25, 2019 at 9:11 AM Aulisa, Eugenio via petsc-users
mailto:petsc-users@mcs.anl.gov>> wrote:
Hi,
I have a vector with ghost nodes where each process may or may not change the
value of a specific ghost node (using INSERT_VALUES).
At the end I would like for each process, that see a
"Povolotskyi, Mykhailo via petsc-users" writes:
> Hi Matthew,
>
> is it possible to do in principle what I would like to do?
SNES isn't meant to solve tiny independent systems. (It's just high
overhead for that purpose.) You can solve many such instances together
by creating a residual functio
Hi Matthew,
is it possible to do in principle what I would like to do?
On 9/25/2019 3:12 AM, Matthew Knepley wrote:
On Wed, Sep 25, 2019 at 1:27 AM Povolotskyi, Mykhailo via petsc-users
mailto:petsc-users@mcs.anl.gov>> wrote:
Dear Petsc developers,
in my application I have to solve millions of
> El 25 sept 2019, a las 16:18, Michael Werner via petsc-users
> escribió:
>
> Hello,
>
> I'm looking for advice on how to set shift and antishift for the cayley
> spectral transformation. So far I've been using sinvert to find the
> eigenvalues with the smallest real part (but possibly larg
Hello,
I'm looking for advice on how to set shift and antishift for the cayley
spectral transformation. So far I've been using sinvert to find the
eigenvalues with the smallest real part (but possibly large imaginary
part). For this, I use the following options:
-st_type sinvert
-eps_target -0.05
Hi,
I have a vector with ghost nodes where each process may or may not change the
value of a specific ghost node (using INSERT_VALUES).
At the end I would like for each process, that see a particular ghost node, to
have the smallest of the set values.
I do not think there is a straightforwa
