fix typo for pardiso

Author: j-fu

lib/LinearSolvePardiso/Project.toml

@@ -8,12 +8,13 @@ LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 LinearSolve = "7ed4a6bd-45f5-4d41-b270-4a48e9bafcae"
 Pardiso = "46dd5b70-b6fb-5a00-ae2d-e8fea33afaf2"
 SciMLBase = "0bca4576-84f4-4d90-8ffe-ffa030f20462"
+SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
 UnPack = "3a884ed6-31ef-47d7-9d2a-63182c4928ed"
 
 [compat]
-SciMLBase = "1.25"
 LinearSolve = "1.24"
-Pardiso =  "0.5"
+Pardiso = "0.5"
+SciMLBase = "1.25"
 UnPack = "1"
 julia = "1.6"
 

lib/LinearSolvePardiso/src/LinearSolvePardiso.jl

@@ -1,14 +1,17 @@
 module LinearSolvePardiso
 
 using Pardiso, LinearSolve, SciMLBase
+using SparseArrays
+using SparseArrays: nonzeros, rowvals, getcolptr
+
 using UnPack
 
 Base.@kwdef struct PardisoJL <: LinearSolve.SciMLLinearSolveAlgorithm
-    nprocs::Union{Int, Nothing} = nothing
-    solver_type::Union{Int, Pardiso.Solver, Nothing} = nothing
-    matrix_type::Union{Int, Pardiso.MatrixType, Nothing} = nothing
-    iparm::Union{Vector{Tuple{Int, Int}}, Nothing} = nothing
-    dparm::Union{Vector{Tuple{Int, Int}}, Nothing} = nothing
+    nprocs::Union{Int,Nothing} = nothing
+    solver_type::Union{Int,Pardiso.Solver,Nothing} = nothing
+    matrix_type::Union{Int,Pardiso.MatrixType,Nothing} = nothing
+    iparm::Union{Vector{Tuple{Int,Int}},Nothing} = nothing
+    dparm::Union{Vector{Tuple{Int,Int}},Nothing} = nothing
 end
 
 MKLPardisoFactorize(; kwargs...) = PardisoJL(; solver_type = 0, kwargs...)
@@ -17,9 +20,19 @@ LinearSolve.needs_concrete_A(alg::PardisoJL) = true
 
 # TODO schur complement functionality
 
-function LinearSolve.init_cacheval(alg::PardisoJL, A, b, u, Pl, Pr, maxiters::Int, abstol,
-                                   reltol, verbose::Bool,
-                                   assumptions::LinearSolve.OperatorAssumptions)
+function LinearSolve.init_cacheval(
+    alg::PardisoJL,
+    A,
+    b,
+    u,
+    Pl,
+    Pr,
+    maxiters::Int,
+    abstol,
+    reltol,
+    verbose::Bool,
+    assumptions::LinearSolve.OperatorAssumptions,
+)
     @unpack nprocs, solver_type, matrix_type, iparm, dparm = alg
     A = convert(AbstractMatrix, A)
 
@@ -90,7 +103,12 @@ function LinearSolve.init_cacheval(alg::PardisoJL, A, b, u, Pl, Pr, maxiters::In
         Pardiso.set_iparm!(solver, 3, round(Int, abs(log10(reltol)), RoundDown) * 10 + 1)
     end
 
-    Pardiso.pardiso(solver, u, SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A), nonzeros(A), b)
+    Pardiso.pardiso(
+        solver,
+        u,
+        SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A), nonzeros(A)),
+        b,
+    )
 
     return solver
 end

lib/LinearSolvePardiso/test/runtests.jl

@@ -1,9 +1,11 @@
 using LinearSolve, LinearSolvePardiso, SparseArrays, Random
 
-A1 = sparse([1.0 0 -2 3
-             0 5 1 2
-             -2 1 4 -7
-             3 2 -7 5])
+A1 = sparse([
+    1.0 0 -2 3
+    0 5 1 2
+    -2 1 4 -7
+    3 2 -7 5
+])
 b1 = rand(4)
 prob1 = LinearProblem(A1, b1)
 
@@ -17,9 +19,7 @@ cache_kwargs = (; verbose = true, abstol = 1e-8, reltol = 1e-8, maxiter = 30)
 
 prob2 = LinearProblem(A2, b2)
 
-for alg in (PardisoJL(),
-            MKLPardisoFactorize(),
-            MKLPardisoIterate())
+for alg in (PardisoJL(), MKLPardisoFactorize(), MKLPardisoIterate())
     u = solve(prob1, alg; cache_kwargs...).u
     @test A1 * u ≈ b1