> On Jul 24, 2024, at 5:33 PM, Sreeram R Venkat wrote:
>
> Thanks for the suggestions; I will try them out.
>
> Dense factorization is used as the benchmark for Top500 right? That's why I
> thought there would be some state-of-the-art multi GPU dense linear solvers
> out there.
>
> I saw th
Currently we don't support Kokkos dense matrix and its solvers. You can
use MATSEQDENSECUDA/HIP
--Junchao Zhang
On Wed, Jul 24, 2024 at 2:08 PM Barry Smith wrote:
>
>For one MPI rank, it looks like you can use -pc_type cholesky
> -pc_factor_mat_solver_type cupm though it is not documente
Thanks for the suggestions; I will try them out.
Dense factorization is used as the benchmark for Top500 right? That's why I
thought there would be some state-of-the-art multi GPU dense linear solvers
out there.
I saw this library called cuSOLVERMp
https://urldefense.us/v3/__https://docs.nvidia.c
For one MPI rank, it looks like you can use -pc_type cholesky
-pc_factor_mat_solver_type cupm though it is not documented in
https://urldefense.us/v3/__https://petsc.org/release/overview/linear_solve_table/*direct-solvers__;Iw!!G_uCfscf7eWS!YpFrRe8Wul8hbJjnWia9KlpTHLeU2HBIpo45YA5ZnmqISNTy0txG
I have an SPD dense matrix of size NxN, where N can range from 10^4-10^5.
Are there any Cholesky factorization/solve routines for it in PETSc (or in
any of the external libraries)? If possible, I want to use GPU acceleration
with 1 or more GPUs. The matrix type can be MATSEQDENSE/MATMPIDENSE or
MAT
