Solve with AdjointFactorization of Cholmod and Adjoint rhs

src/solvers/cholmod.jl

@@ -15,7 +15,7 @@
 using Base: require_one_based_indexing
 
 using LinearAlgebra
-using LinearAlgebra: RealHermSymComplexHerm, AdjOrTrans
+using LinearAlgebra: RealHermSymComplexHerm, AdjOrTrans, AdjOrTransAbsMat
 import LinearAlgebra: (\), AdjointFactorization,
                  cholesky, cholesky!, det, diag, ishermitian, isposdef,
                  issuccess, issymmetric, ldiv!, ldlt, ldlt!, logdet,
@@ -1928,6 +1928,7 @@
     L = adjL.parent
     return Matrix(solve(CHOLMOD_A, L, Dense(B)))
 end
+(\)(adjL::AdjointFactorization{<:VTypes,<:Factor}, B::AdjOrTransAbsMat) = adjL \ copy(B)
 
 const RealHermSymComplexHermSSL{Ti, Tr} = Union{
     Symmetric{Tr, SparseMatrixCSC{Tr, Ti}},

test/cholmod.jl

@@ -12,7 +12,7 @@ using SparseArrays.CHOLMOD: getcommon
 using Random
 using Serialization
 using LinearAlgebra:
-    I, cholesky, cholesky!, det, diag, eigmax, ishermitian, isposdef, issuccess,
+    I, cholesky, cholesky!, det, diag, eigmax, ishermitian, isposdef, issuccess, factorize,
     issymmetric, ldiv!, ldlt, ldlt!, logdet, norm, opnorm, Diagonal, Hermitian, Symmetric,
     PosDefException, ZeroPivotException, RowMaximum
 using SparseArrays
@@ -1019,6 +1019,21 @@ end
     # @test_throws ErrorException cholesky(view(A, :, :), NoPivot())
 end
 
+@testset "solve with adjoint factorization and adjoint rhs" begin
+    n = 10
+    A = sprand(Tv, n, n, 1/n)
+    A = A + A' + 10I
+
+    B = rand(n, 2)
+    Bt = Matrix(B')
+    Bts = sparse(B')
+
+    F = cholesky(A')
+    @test F \ B ≈ F \ Bt'
+    @test F \ B ≈ F \ Bts'
+    @test issparse(F \ Bts')
+end
+
 end # for Tv ∈ (Float32, Float64)
 
 end # Base.USE_GPL_LIBS