@@ -13,30 +13,21 @@ n = 4
13
13
e = ones (n)
14
14
e2 = ones (n - 1 )
15
15
A2 = spdiagm (- 1 => im * e2, 0 => lambda * e, 1 => - im * e2)
16
-
17
16
b2 = rand (n) + im * zeros (n)
18
- cache_kwargs = (; verbose = true , abstol = 1e-8 , reltol = 1e-8 , maxiter = 30 )
19
-
20
17
prob2 = LinearProblem (A2, b2)
21
18
22
- for alg in (PardisoJL (), MKLPardisoFactorize ())
23
- u = solve (prob1, alg; cache_kwargs... ). u
24
- @test A1 * u ≈ b1
25
-
26
- u = solve (prob2, alg; cache_kwargs... ). u
27
- @test eltype (u) <: Complex
28
- @test A2 * u ≈ b2
29
- end
19
+ cache_kwargs = (; abstol = 1e-8 , reltol = 1e-8 , maxiter = 30 )
30
20
31
- for alg in (MKLPardisoIterate (),)
32
- u = solve (prob1, alg; cache_kwargs... ). u
33
- @test A1 * u ≈ b1
21
+ for alg in (PardisoJL (), MKLPardisoFactorize (), MKLPardisoIterate () )
22
+ u = solve (prob1, alg; cache_kwargs... ). u
23
+ @test A1 * u ≈ b1
34
24
35
- u = solve (prob2, alg; cache_kwargs... ). u
36
- @test eltype (u) <: Complex
37
- @test A2 * u ≈ b2
25
+ u = solve (prob2, alg; cache_kwargs... ). u
26
+ @test eltype (u) <: Complex
27
+ @test A2 * u ≈ b2
38
28
end
39
29
30
+ return
40
31
41
32
42
33
Random. seed! (10 )
79
70
A= makeA ()
80
71
u0= fill (0.1 ,size (A,2 ))
81
72
linprob = LinearProblem (A, A* u0)
82
- u = LinearSolve. solve (linprob, PardisoJL (),verbose = true )
73
+ u = LinearSolve. solve (linprob, PardisoJL ())
83
74
@test norm (u- u0) < 1.0e-14
84
75
85
76
0 commit comments