Open avik-pal opened 3 months ago
I don't get what this means.
https://github.com/SciML/LinearSolve.jl/blob/7911113c6b14b6897cc356e277ccd5a98faa7dd7/src/factorization.jl#L324 sets the algorithm as DivideAndConquer
, the CUSOLVER ones which is dispatched via svd(::CuArray)
don't map directly to the LinearAlgebra ones so svd(::CuArray; alg = DivideAndConquer()
is an error
I see. We had to do the same before with QR factorization pivoting choices. This is an easy thing to fix, good first issue.
Selecting an algorithm for SVDFactorization will cause it to fail for CUDA. Possible solutions:
nothing
and use the default versions used in the downstream package