Remove dependency on LinearSolve.jl. Wait instead for implementation of SciML/LinearSolve.jl#190

Author: j-fu

Project.toml

@@ -7,26 +7,17 @@ version = "0.7.0"
 DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"
 IterativeSolvers = "42fd0dbc-a981-5370-80f2-aaf504508153"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
-LinearSolve = "7ed4a6bd-45f5-4d41-b270-4a48e9bafcae"
-LinearSolvePardiso = "a6722589-28b8-4472-944e-bde9ee6da670"
 Pardiso = "46dd5b70-b6fb-5a00-ae2d-e8fea33afaf2"
 Printf = "de0858da-6303-5e67-8744-51eddeeeb8d7"
 Requires = "ae029012-a4dd-5104-9daa-d747884805df"
-SciMLBase = "0bca4576-84f4-4d90-8ffe-ffa030f20462"
-Setfield = "efcf1570-3423-57d1-acb7-fd33fddbac46"
 SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
 SuiteSparse = "4607b0f0-06f3-5cda-b6b1-a6196a1729e9"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
-UnPack = "3a884ed6-31ef-47d7-9d2a-63182c4928ed"
 
 [compat]
 DocStringExtensions = "0.8.0,0.9"
 IterativeSolvers = "0.9.2"
-LinearSolve = "1.23"
 Requires = "1.1.3"
-SciMLBase = "1.49"
-Setfield = "0.7, 0.8, 1"
-UnPack = "1"
 julia = "1.6"
 
 [extras]

src/ExtendableSparse.jl

@@ -2,9 +2,6 @@ module ExtendableSparse
 using SparseArrays
 using LinearAlgebra
 using SuiteSparse
-using Setfield: @set!
-using UnPack: @unpack
-import LinearSolve,SciMLBase
 
 using Requires
 
@@ -20,10 +17,6 @@ include("extendable.jl")
 export SparseMatrixLNK,ExtendableSparseMatrix,flush!,nnz, updateindex!, rawupdateindex!, colptrs
 
 
-include("linearsolve.jl")
-
-
-
 include("factorizations.jl")
 export JacobiPreconditioner, ILU0Preconditioner, ParallelJacobiPreconditioner, ParallelILU0Preconditioner, reorderlinsys
 export AbstractFactorization,LUFactorization, CholeskyFactorization

src/linearsolve.jl

@@ -4,7 +4,6 @@ BenchmarkTools = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
 IncompleteLU = "40713840-3770-5561-ab4c-a76e7d0d7895"
 IterativeSolvers = "42fd0dbc-a981-5370-80f2-aaf504508153"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
-LinearSolve = "7ed4a6bd-45f5-4d41-b270-4a48e9bafcae"
 Pardiso = "46dd5b70-b6fb-5a00-ae2d-e8fea33afaf2"
 Printf = "de0858da-6303-5e67-8744-51eddeeeb8d7"
 SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"

test/Project.toml

@@ -10,7 +10,6 @@ using AlgebraicMultigrid
 using IncompleteLU
 using IterativeSolvers
 
-using LinearSolve
 
 ##############################################################
 @testset "Constructors" begin
@@ -464,33 +463,3 @@ end
     @test test_parilu0(1000)
 end
 
-
-function test_linearsolve(n)
- 
-    A=fdrand(n,1,1, matrixtype=ExtendableSparseMatrix)
-    b=rand(n)
-    c=A\b
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b)).u
-    
-    A=fdrand(n,n,1, matrixtype=ExtendableSparseMatrix)
-    b=rand(n*n)
-    c=A\b
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b)).u
-
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),UMFPACKFactorization()).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),KLUFactorization()).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),IterativeSolversJL_CG(),Pl=ILU0Preconditioner(A)).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),IterativeSolversJL_CG(),Pl=JacobiPreconditioner(A)).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),IterativeSolversJL_CG(),Pl=ParallelJacobiPreconditioner(A)).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),IterativeSolversJL_CG(),Pl=ILUTPreconditioner(A)).u
-    @test c ≈ LinearSolve.solve(LinearProblem(A,b),IterativeSolversJL_CG(),Pl=AMGPreconditioner(A)).u
-
-    
-end
-
-if Base.USE_GPL_LIBS
-#requires SuiteSparse which is not available on non-GPL builds
-@testset "LinearSolve" begin
-    test_linearsolve(20)
-end
-end