310310
311311# Fallback, tries to make nonsingular and just factorizes
312312# Try to never use it.
313- function init_cacheval (alg:: GenericFactorization ,
314- A, b, u, Pl, Pr, maxiters:: Int , abstol, reltol, verbose:: Bool ,
315- assumptions:: OperatorAssumptions )
316- newA = copy (convert (AbstractMatrix, A))
317- if newA isa AbstractSparseMatrix
318- fill! (nonzeros (newA), true )
319- else
320- fill! (newA, true )
321- end
322- do_factorization (alg, newA, b, u)
323- end
324313
325314# Cholesky needs the posdef matrix, for GenericFactorization assume structure is needed
326315function init_cacheval (alg:: Union {GenericFactorization,
@@ -333,15 +322,6 @@ function init_cacheval(alg::Union{GenericFactorization,
333322end
334323
335324# Ambiguity handling dispatch
336- function init_cacheval (alg:: Union {GenericFactorization,
337- GenericFactorization{typeof (cholesky)},
338- GenericFactorization{typeof (cholesky!)}},
339- A:: StridedMatrix{<:LinearAlgebra.BlasFloat} , b, u, Pl, Pr,
340- maxiters:: Int ,
341- abstol, reltol, verbose:: Bool , assumptions:: OperatorAssumptions )
342- newA = copy (convert (AbstractMatrix, A))
343- do_factorization (alg, newA, b, u)
344- end
345325
346326# ################################# Factorizations which require solve overloads
347327
0 commit comments