implemented adjoint, inv

Author: vpuri3

src/LinearSolve.jl

@@ -3,13 +3,12 @@ module LinearSolve
 using ArrayInterface
 using RecursiveFactorization
 using Base: cache_dependencies, Bool
-import Base: eltype, *
+import Base: eltype, adjoint, inv
 using LinearAlgebra
 using SparseArrays
 using SciMLBase: AbstractDiffEqOperator, AbstractLinearAlgorithm
 using Setfield
 using UnPack
-using FastBroadcast
 
 # wrap
 import Krylov

src/wrappers.jl

@@ -6,7 +6,7 @@
  P  *  x = x .* (1/P.s)
  Pi *  x = x .* (P.s)
 
- Right
+ RIGHT
  P  *  x = x .* (P.s)
  Pi *  x = x .* (1/P.s)
 """
@@ -16,19 +16,15 @@ struct ScaleVector{T}
 end
 
 Base.eltype(A::ScaleVector) = eltype(A.s)
-
-#function Base.*(A::ScaleVector, x)
-#    y = similar(x)
-#    mul!(y, A, x)
-#end
+Base.adjoint(A::ScaleVector) = copy(A)
+Base.inv(A::ScaleVector) = ScaleVector(1/A.s, A.isleft)
 
 # y = A x
 function LinearAlgebra.mul!(y, A::ScaleVector, x)
     A.s == one(eltype(A.s)) && return y = x
 
     s = A.isleft ? 1/A.s : A.s
     mul!(y, s, x)
-
 end
 
 # A B α + C β
@@ -63,6 +59,8 @@ struct ComposePreconditioner{Ti,To}
 end
 
 Base.eltype(A::ComposePreconditioner) = Float64 #eltype(A.inner)
+Base.adjoint(A::ComposePreconditioner) = ComposePreconditioner(A.outer', A.inner')
+Base.inv(A::ComposePreconditioner) = ComposePreconditioner(inv(A.outer), inv(A.inner))
 
 # y = A x
 function LinearAlgebra.mul!(y, A::ComposePreconditioner, x)
@@ -200,6 +198,10 @@ function SciMLBase.solve(cache::LinearCache, alg::KrylovJL; kwargs...)
     M = alg.Pl
     N = alg.Pr
 
+    """
+    TODO - pass in inv(Pl), inv(Pr) to Krylov.jl
+    """
+
 #   M = ComposePreconditioner(alg.Pl, cache.Pl) # left precond
 #   N = ComposePreconditioner(alg.Pr, cache.Pr) # right