Partitioning on a mpiaij matrix

- Original Message - From: Barry Smith bsm...@mcs.anl.gov Date: Friday, February 9, 2007 8:09 pm Subject: Re: Partitioning on a mpiaij matrix MatConvert() checks for a variety of converts; from the code /* 3) See if a good general converter is registered for the desired

External software help

://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20070212/2965ffaf/attachment.htm

External software help

are different packages - the first one is sequential - the second one is parallel] Satish Thank you very much. Regards. -- next part -- An HTML attachment was scrubbed... URL: http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20070212/0eaad54a

A 3D example of KSPSolve?

Well some how the inbalance comes up in your application run - but not in the test example. It is possible that the application stresses your machine/memory-subsytem a lot more than the test code. Your machine has a NUMA [Non-unimform memory access] - so some messages are local [if the memory is

External software help

On Mon, 12 Feb 2007, Ben Tay wrote: Hi Satish, I've installed superlu. I issued the command ./a.out -mat_type superlu -ksp_type preonly -pc_type lu and it just hanged there. Did you install superlu separately? Sugest installing with PETSc configure option '--download-superlu=1. Is it

External software help

You may test the installation of superlu using petsc example src/ksp/ksp/examples/tutorials/ex5.c: e.g., ./ex5 -ksp_type preonly -pc_type lu -mat_type superlu -ksp_view | more KSP Object: type: preonly maximum iterations=1, initial guess is zero tolerances: relative=1e-05,

nonlinear solvers

On 2/12/07, Manav Bhatia bhatiamanav at gmail.com wrote: Hi, I am using the nonlinear solvers in Petsc. My application requires the jacobian at the final nonlinear solution, since after the nonlinear solution I solve a linear system of equations with the jacobian as the system matrix.

Using ICC for MPISBAIJ?

Hi All, Thank you very much for the help you gave me in tuning my code. I now think it is important for us to take advantage of the symmetric positive definiteness property of our Matrix, i.e., we should use the conjugate gradient (CG) method with incomplete Cholesky decomposition (ICC) as the

Using ICC for MPISBAIJ?

Thank you very much for the help you gave me in tuning my code. I now think it is important for us to take advantage of the symmetric positive definiteness property of our Matrix, i.e., we should use the conjugate gradient (CG) method with incomplete Cholesky decomposition (ICC) as the

Using ICC for MPISBAIJ?

I forget to tell you that you can use parallel CG with block-jacobi, and sequential icc within the diagonal blocks. Example, run src/ksp/ksp/examples/tutorials/ex5 with mpirun -np 2 ./ex5 -ksp_type cg -pc_type bjacobi -sub_pc_type icc -ksp_view Use '-help' to get many options on icc. Hong On