Hi,
To my knowledge Cholesky factorization is performed in two steps. The first step is the symbolic factorization, where non zero entries are predicted in the worst case scenario and post ordering is performed. Then the actual numerical factorization is performed, given the symbolic one.
I wonder if SuiteSparse has a GPU implementation of the former. Because is graph traversal / tree construction based I suspect not, but I'd like confirmation (I cannot see any in code).
Hi,
To my knowledge Cholesky factorization is performed in two steps. The first step is the symbolic factorization, where non zero entries are predicted in the worst case scenario and post ordering is performed. Then the actual numerical factorization is performed, given the symbolic one.
I wonder if SuiteSparse has a GPU implementation of the former. Because is graph traversal / tree construction based I suspect not, but I'd like confirmation (I cannot see any in code).