expand the tests of the default algorithm

Author: ChrisRackauckas

src/factorization.jl

@@ -4,7 +4,7 @@ function SciMLBase.solve(cache::LinearCache, alg::AbstractFactorization)
         cache = set_cacheval(cache, fact)
     end
 
-    ldiv!(cache.u,cache.cacheval, cache.b)
+    ldiv!(cache.u, cache.cacheval, cache.b)
 end
 
 ## LUFactorization

test/runtests.jl

@@ -1,4 +1,4 @@
-using LinearSolve, LinearAlgebra
+using LinearSolve, LinearAlgebra, SparseArrays
 using Test
 
 n = 8
@@ -38,6 +38,26 @@ end
     A1 = prob1.A; b1 = prob1.b; x1 = prob1.u0
     y = solve(prob1)
     @test A1 *  y  ≈ b1
+
+    _prob = LinearProblem(SymTridiagonal(A1.A), b1; u0=x1)
+    y = solve(prob1)
+    @test A1 *  y  ≈ b1
+
+    _prob = LinearProblem(Tridiagonal(A1.A), b1; u0=x1)
+    y = solve(prob1)
+    @test A1 *  y  ≈ b1
+
+    _prob = LinearProblem(Symmetric(A1.A), b1; u0=x1)
+    y = solve(prob1)
+    @test A1 *  y  ≈ b1
+
+    _prob = LinearProblem(Hermitian(A1.A), b1; u0=x1)
+    y = solve(prob1)
+    @test A1 *  y  ≈ b1
+
+    _prob = LinearProblem(sparse(A1.A), b1; u0=x1)
+    y = solve(prob1)
+    @test A1 *  y  ≈ b1
 end
 
 @testset "Concrete Factorizations" begin