[petsc-users] Setting up MUMPS in PETSc

Jinquan Zhong jzhong at scsolutions.com
Tue Oct 23 14:48:46 CDT 2012



From: petsc-users-bounces at mcs.anl.gov [mailto:petsc-users-bounces at mcs.anl.gov] On Behalf Of Jed Brown
Sent: Tuesday, October 23, 2012 12:45 PM
To: PETSc users list
Subject: Re: [petsc-users] Setting up MUMPS in PETSc

On Tue, Oct 23, 2012 at 2:36 PM, Jinquan Zhong <jzhong at scsolutions.com<mailto:jzhong at scsolutions.com>> wrote:
>> That is a good point.  In these applications, we don’t usually have a good-conditioned matrix . The condition number is always around 10^10--10^12.  This is out of our control.

This is something you may have to "take control" of if you want accurate solutions. You can also compute in quad precision (--with-precision=__float128), but AFAIK, there are no quad-precision distributed memory sparse direct solvers.



Is this the reason you want to use a direct solver instead of iterative one?
What do you mean "31k with a dense matrix included in the sparse matrix"?


>> We have a dense matrix embedded inside a sparse matrix.  This dense matrix usually accounts for 99% of the total nnz’s.

What does that dense coupling represent?


>> Soil-structure interaction.


How sparse is your matrix, e.g., nnz(A)/(m*m)=?

>> ~=0.4% for medium size problem and 0.04% for large size problem.

Uhh, your numbers for the large problem are 178k^2 / 640k^2 = 7.8%.

>> my bad.

Both a and b seem indicate that, you can use small num of cores to generate original matrix A, but need more cores (resource) to solve A x =b.

>> My confusion is that since the sparse matrix size is the same, why resource for 1152 cores are needed for 576 partitions on A, while only resource for 432 cores are needed for 144 partitions on A?  If using 432 cores can solve the 144- partition Ax=b, why did it need 1152 cores to solve 576-partition Ax=b?  I expected 576 cores could do the job that 432 cores did on the 576-partition Ax=b.

The amount of fill depends on the size of minimal vertex separators. Sparse matrices with the same number of nonzeros and same number of nonzeros per row can have vertex separators that are orders of magnitude different in size. The fill is quadratic in the size of the separators and computation is cubic.
>> Could you be more specific?  I am not quite with you yet.

Is your problem symmetric?

>> Yes.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-users/attachments/20121023/2d4e1847/attachment.html>


More information about the petsc-users mailing list