309
309
310
310
# Fallback, tries to make nonsingular and just factorizes
311
311
# Try to never use it.
312
- function init_cacheval (alg:: Union{QRFactorization, SVDFactorization, GenericFactorization} ,
312
+ function init_cacheval (alg:: GenericFactorization ,
313
313
A, b, u, Pl, Pr, maxiters:: Int , abstol, reltol, verbose:: Bool ,
314
314
assumptions:: OperatorAssumptions )
315
315
newA = copy (convert (AbstractMatrix, A))
@@ -321,20 +321,6 @@ function init_cacheval(alg::Union{QRFactorization, SVDFactorization, GenericFact
321
321
do_factorization (alg, newA, b, u)
322
322
end
323
323
324
- # Ambiguity handling dispatch
325
- function init_cacheval (alg:: Union{QRFactorization, SVDFactorization} ,
326
- A:: StridedMatrix{<:LinearAlgebra.BlasFloat} , b, u, Pl, Pr,
327
- maxiters:: Int ,
328
- abstol, reltol, verbose:: Bool , assumptions:: OperatorAssumptions )
329
- newA = copy (convert (AbstractMatrix, A))
330
- if newA isa AbstractSparseMatrix
331
- fill! (nonzeros (newA), true )
332
- else
333
- fill! (newA, true )
334
- end
335
- do_factorization (alg, newA, b, u)
336
- end
337
-
338
324
# Cholesky needs the posdef matrix, for GenericFactorization assume structure is needed
339
325
function init_cacheval (alg:: Union {GenericFactorization,
340
326
GenericFactorization{typeof (cholesky)},
0 commit comments