31
31
function LinearSolve. init_cacheval (alg:: RFLUFactorization ,
32
32
A:: Union{AbstractSparseArray, LinearSolve.SciMLOperators.AbstractSciMLOperator} , b, u, Pl, Pr,
33
33
maxiters:: Int ,
34
- abstol, reltol, verbose:: Bool , assumptions:: OperatorAssumptions )
34
+ abstol, reltol, verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
35
35
nothing , nothing
36
36
end
37
37
62
62
function LinearSolve. init_cacheval (alg:: GenericFactorization ,
63
63
A:: Union {Hermitian{T, <: SparseMatrixCSC },
64
64
Symmetric{T, <: SparseMatrixCSC }}, b, u, Pl, Pr,
65
- maxiters:: Int , abstol, reltol, verbose:: Bool ,
65
+ maxiters:: Int , abstol, reltol, verbose:: LinearVerbosity ,
66
66
assumptions:: OperatorAssumptions ) where {T}
67
67
newA = copy (convert (AbstractMatrix, A))
68
68
LinearSolve. do_factorization (alg, newA, b, u)
@@ -75,39 +75,39 @@ function LinearSolve.init_cacheval(
75
75
alg:: LUFactorization , A:: AbstractSparseArray{<:Number, <:Integer} , b, u,
76
76
Pl, Pr,
77
77
maxiters:: Int , abstol, reltol,
78
- verbose:: Bool , assumptions:: OperatorAssumptions )
78
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
79
79
nothing
80
80
end
81
81
82
82
function LinearSolve. init_cacheval (
83
83
alg:: GenericLUFactorization , A:: AbstractSparseArray{<:Number, <:Integer} , b, u,
84
84
Pl, Pr,
85
85
maxiters:: Int , abstol, reltol,
86
- verbose:: Bool , assumptions:: OperatorAssumptions )
86
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
87
87
nothing
88
88
end
89
89
90
90
function LinearSolve. init_cacheval (
91
91
alg:: UMFPACKFactorization , A:: AbstractArray , b, u,
92
92
Pl, Pr,
93
93
maxiters:: Int , abstol, reltol,
94
- verbose:: Bool , assumptions:: OperatorAssumptions )
94
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
95
95
nothing
96
96
end
97
97
98
98
function LinearSolve. init_cacheval (
99
99
alg:: LUFactorization , A:: AbstractSparseArray{Float64, Int64} , b, u,
100
100
Pl, Pr,
101
101
maxiters:: Int , abstol, reltol,
102
- verbose:: Bool , assumptions:: OperatorAssumptions )
102
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
103
103
PREALLOCATED_UMFPACK
104
104
end
105
105
106
106
function LinearSolve. init_cacheval (
107
107
alg:: LUFactorization , A:: AbstractSparseArray{T, Int64} , b, u,
108
108
Pl, Pr,
109
109
maxiters:: Int , abstol, reltol,
110
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
110
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
111
111
if LinearSolve. is_cusparse (A)
112
112
ArrayInterface. lu_instance (A)
113
113
else
@@ -119,7 +119,7 @@ function LinearSolve.init_cacheval(
119
119
alg:: LUFactorization , A:: AbstractSparseArray{T, Int32} , b, u,
120
120
Pl, Pr,
121
121
maxiters:: Int , abstol, reltol,
122
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
122
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
123
123
if LinearSolve. is_cusparse (A)
124
124
ArrayInterface. lu_instance (A)
125
125
else
@@ -139,7 +139,7 @@ function LinearSolve.init_cacheval(
139
139
alg:: UMFPACKFactorization , A:: AbstractSparseArray{Float64, Int} , b, u, Pl, Pr,
140
140
maxiters:: Int , abstol,
141
141
reltol,
142
- verbose:: Bool , assumptions:: OperatorAssumptions )
142
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
143
143
144
144
PREALLOCATED_UMFPACK
145
145
end
@@ -156,15 +156,15 @@ function LinearSolve.init_cacheval(
156
156
alg:: UMFPACKFactorization , A:: AbstractSparseArray{T, Int64} , b, u,
157
157
Pl, Pr,
158
158
maxiters:: Int , abstol, reltol,
159
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
159
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
160
160
SparseArrays. UMFPACK. UmfpackLU (SparseMatrixCSC {T, Int64} (zero (Int64), zero (Int64), [Int64 (1 )], Int64[], T[]))
161
161
end
162
162
163
163
function LinearSolve. init_cacheval (
164
164
alg:: UMFPACKFactorization , A:: AbstractSparseArray{T, Int32} , b, u,
165
165
Pl, Pr,
166
166
maxiters:: Int , abstol, reltol,
167
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
167
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T<: BLASELTYPES }
168
168
SparseArrays. UMFPACK. UmfpackLU (SparseMatrixCSC {T, Int32} (zero (Int32), zero (Int32), [Int32 (1 )], Int32[], T[]))
169
169
end
170
170
@@ -211,15 +211,15 @@ function LinearSolve.init_cacheval(
211
211
alg:: KLUFactorization , A:: AbstractArray , b, u, Pl,
212
212
Pr,
213
213
maxiters:: Int , abstol, reltol,
214
- verbose:: Bool , assumptions:: OperatorAssumptions )
214
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
215
215
nothing
216
216
end
217
217
218
218
function LinearSolve. init_cacheval (
219
219
alg:: KLUFactorization , A:: AbstractSparseArray{Float64, Int64} , b, u, Pl, Pr,
220
220
maxiters:: Int , abstol,
221
221
reltol,
222
- verbose:: Bool , assumptions:: OperatorAssumptions )
222
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
223
223
PREALLOCATED_KLU
224
224
end
225
225
@@ -235,7 +235,7 @@ function LinearSolve.init_cacheval(
235
235
alg:: KLUFactorization , A:: AbstractSparseArray{Float64, Int32} , b, u, Pl, Pr,
236
236
maxiters:: Int , abstol,
237
237
reltol,
238
- verbose:: Bool , assumptions:: OperatorAssumptions )
238
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
239
239
KLU. KLUFactorization (SparseMatrixCSC {Float64, Int32} (0 , 0 , [Int32 (1 )], Int32[], Float64[]))
240
240
end
241
241
@@ -279,7 +279,7 @@ function LinearSolve.init_cacheval(alg::CHOLMODFactorization,
279
279
A:: Union{SparseMatrixCSC{T, Int}, Symmetric{T, SparseMatrixCSC{T, Int}}} , b, u,
280
280
Pl, Pr,
281
281
maxiters:: Int , abstol, reltol,
282
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T < :
282
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T < :
283
283
Float64}
284
284
PREALLOCATED_CHOLMOD
285
285
end
@@ -288,7 +288,7 @@ function LinearSolve.init_cacheval(alg::CHOLMODFactorization,
288
288
A:: Union{SparseMatrixCSC{T, Int}, Symmetric{T, SparseMatrixCSC{T, Int}}} , b, u,
289
289
Pl, Pr,
290
290
maxiters:: Int , abstol, reltol,
291
- verbose:: Bool , assumptions:: OperatorAssumptions ) where {T < :
291
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions ) where {T < :
292
292
BLASELTYPES}
293
293
cholesky (sparse (reshape ([one (T)],1 ,1 )))
294
294
end
@@ -297,14 +297,14 @@ function LinearSolve.init_cacheval(alg::CHOLMODFactorization,
297
297
A:: AbstractArray , b, u,
298
298
Pl, Pr,
299
299
maxiters:: Int , abstol, reltol,
300
- verbose:: Bool , assumptions:: OperatorAssumptions )
300
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
301
301
nothing
302
302
end
303
303
304
304
function LinearSolve. init_cacheval (alg:: NormalCholeskyFactorization ,
305
305
A:: Union {AbstractSparseArray{T}, LinearSolve. GPUArraysCore. AnyGPUArray,
306
306
Symmetric{T, <: AbstractSparseArray{T} }}, b, u, Pl, Pr,
307
- maxiters:: Int , abstol, reltol, verbose:: Bool ,
307
+ maxiters:: Int , abstol, reltol, verbose:: LinearVerbosity ,
308
308
assumptions:: OperatorAssumptions ) where {T <: BLASELTYPES }
309
309
ArrayInterface. cholesky_instance (convert (AbstractMatrix, A))
310
310
end
@@ -364,7 +364,7 @@ function LinearSolve.init_cacheval(
364
364
alg:: QRFactorization , A:: AbstractSparseArray{<:Number, <:Integer} , b, u,
365
365
Pl, Pr,
366
366
maxiters:: Int , abstol, reltol,
367
- verbose:: Bool , assumptions:: OperatorAssumptions )
367
+ verbose:: LinearVerbosity , assumptions:: OperatorAssumptions )
368
368
nothing
369
369
end
370
370
376
376
377
377
function LinearSolve. init_cacheval (
378
378
alg:: QRFactorization , A:: Symmetric{<:Number, <:SparseMatrixCSC} , b, u, Pl, Pr,
379
- maxiters:: Int , abstol, reltol, verbose:: Bool ,
379
+ maxiters:: Int , abstol, reltol, verbose:: LinearVerbosity ,
380
380
assumptions:: OperatorAssumptions )
381
381
return nothing
382
382
end
0 commit comments