On Sun, Jul 5, 2015 at 11:57 AM, Filippo Leonardi
filippo.leona...@sam.math.ethz.ch wrote:
Hi all,
I'm starting to migrate my code to DMDAs to use DMPlex but I have troubles
that neither the documentation nor google can answer.
1) I want to to traverse the DAG associated to the DMPlex
El 07/07/2015, a las 02:33, Anthony Haas escribió:
Hi,
I am computing eigenvalues using PETSc/SLEPc and superlu_dist for the LU
decomposition (my problem is a generalized eigenvalue problem). The code runs
fine for a grid with 101x101 but when I increase to 151x151, I get the
following
El 07/07/2015, a las 03:34, Matthew Knepley escribió:
On Mon, Jul 6, 2015 at 7:43 PM, Gideon Simpson gideon.simp...@gmail.com
wrote:
I have a nonlinear eigenvalue problem for a system of equations, of the form,
-Delta u + f(u) = E * u,
where E is my nonlinear eigenvalue parameter, and
Jose E. Roman jro...@dsic.upv.es writes:
I guess what Gideon needs to do is compute E from an initial guess of u, then
use SNES to update u, and iterate until a self-consistent state is reached.
Depending on the functional form of the nonlinearity, sometimes you can
prove convergence for such
Thanks, we are solving supersonic flows.
2015-07-07 12:31 GMT-04:00 Jed Brown j...@jedbrown.org:
Song Gao song.g...@mail.mcgill.ca writes:
Dear PETSc users,
We are solving a FEM compressible Navier-Stokes problem. The unknowns are
arranged as [ rho1, rho1*u1, rho1*v1, rho1*w1, e1,
Song Gao song.g...@mail.mcgill.ca writes:
Dear PETSc users,
We are solving a FEM compressible Navier-Stokes problem. The unknowns are
arranged as [ rho1, rho1*u1, rho1*v1, rho1*w1, e1, . ]. We are using
ASM+ILU(0) but I'm playing with fieldsplit preconditioner to assess its
Hi Matthew,
The entries to the last few rows of my matrix has non-local contributions
from a large number of processors. Since the matrix is symmetric, I need
not set the non-local entries in the last few rows as they are equal to
their transpose entries, which on the other hand are stored as
Aha ! That should do the trick. Thanks a lot.
On Tue, Jul 7, 2015 at 4:54 PM, Matthew Knepley knep...@gmail.com wrote:
On Tue, Jul 7, 2015 at 3:52 PM, Bikash Kanungo bik...@umich.edu wrote:
Hi Matthew,
I couldn't follow your reply. It seems a bit unrelated to my query.
Your matrix
On Tue, Jul 7, 2015 at 3:22 PM, Bikash Kanungo bik...@umich.edu wrote:
Hi,
Is there a way to ignore the lower (or upper) triangular entries in an
MATMPIAIJ matrix when I know my matrix is symmetric? I can see a
MAT_SYMMETRIC option in MatSetOption, but I don't think it ignores any
lower (or
On Tue, Jul 7, 2015 at 3:36 PM, Bikash Kanungo bik...@umich.edu wrote:
Hi Matthew,
The entries to the last few rows of my matrix has non-local contributions
from a large number of processors. Since the matrix is symmetric, I need
not set the non-local entries in the last few rows as they are
Hi,
Is there a way to ignore the lower (or upper) triangular entries in an
MATMPIAIJ matrix when I know my matrix is symmetric? I can see a
MAT_SYMMETRIC option in MatSetOption, but I don't think it ignores any
lower (or upper) triangular entry.
I cannot use MATMPISBAIJ due to MatMatMult
Is there an inquiry function that tells you all the available options?
Sherry
On Tue, Jul 7, 2015 at 3:25 PM, Anthony Paul Haas a...@email.arizona.edu
wrote:
Hi Sherry,
Thanks for your message. I have used superlu_dist default options. I did
not realize that I was doing serial symbolic
For superlu_dist failure, this occurs during symbolic factorization. Since
you are using serial symbolic factorization, it requires the entire graph
of A to be available in the memory of one MPI task. How much memory do you
have for each MPI task?
It won't help even if you use more processes.
Hi Barry,
Thanks for you message. I will do the sequence of problems as you
suggested. In the meantime I want also to get started with iterative solver
for SLEPc. I have tried GMRES with bjacobi preconditioner but the
convergence is rather poor. Should I install hypre? Which preconditioner
would
Hi Sherry,
Thanks for your message. I have used superlu_dist default options. I did
not realize that I was doing serial symbolic factorization. That is
probably the cause of my problem.
Each node on Garnet has 60GB usable memory and I can run with 1,2,4,8,16 or
32 core per node.
So I should use:
I would suggest running a sequence of problems, 101 by 101 111 by 111 etc
and get the memory usage in each case (when you run out of memory you can get
NO useful information out about memory needs). You can then plot memory usage
as a function of problem size to get a handle on how much
Hi Matthew,
I couldn't follow your reply. It seems a bit unrelated to my query.
Thanks,
Bikash
On Tue, Jul 7, 2015 at 4:42 PM, Matthew Knepley knep...@gmail.com wrote:
On Tue, Jul 7, 2015 at 3:36 PM, Bikash Kanungo bik...@umich.edu wrote:
Hi Matthew,
The entries to the last few rows of my
On Tue, Jul 7, 2015 at 2:06 AM, Jose E. Roman jro...@dsic.upv.es wrote:
El 07/07/2015, a las 03:34, Matthew Knepley escribió:
On Mon, Jul 6, 2015 at 7:43 PM, Gideon Simpson gideon.simp...@gmail.com
wrote:
I have a nonlinear eigenvalue problem for a system of equations, of the
form,
18 matches
Mail list logo
