@@ -128,7 +128,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
128
128
#
129
129
# RecursiveFactorization seems to be consistantly winning below 100
130
130
# https://discourse.julialang.org/t/ann-recursivefactorization-jl/39213
131
- if ArrayInterface . can_setindex (x) && (size (A,1 ) <= 100 || ((blasvendor === :openblas || blasvendor === :openblas64 ) && size (A,1 ) <= 500 ))
131
+ if ArrayInterfaceCore . can_setindex (x) && (size (A,1 ) <= 100 || ((blasvendor === :openblas || blasvendor === :openblas64 ) && size (A,1 ) <= 500 ))
132
132
p. A = RecursiveFactorization. lu! (A)
133
133
else
134
134
p. A = lu! (A)
@@ -141,7 +141,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
141
141
p. A = bunchkaufman! (A)
142
142
elseif typeof (A) <: SparseMatrixCSC
143
143
p. A = lu (A)
144
- elseif ArrayInterface . isstructured (A)
144
+ elseif ArrayInterfaceCore . isstructured (A)
145
145
p. A = factorize (A)
146
146
elseif ! (typeof (A) <: AbstractDiffEqOperator )
147
147
# Most likely QR is the one that is overloaded
@@ -156,7 +156,7 @@ function (p::DefaultLinSolve)(x,A,b,update_matrix=false;tol=nothing, kwargs...)
156
156
# Missing a little bit of efficiency in a rare case
157
157
# elseif typeof(A) <: DiffEqArrayOperator
158
158
# ldiv!(x,p.A,b)
159
- elseif ArrayInterface . isstructured (A) || A isa SparseMatrixCSC
159
+ elseif ArrayInterfaceCore . isstructured (A) || A isa SparseMatrixCSC
160
160
ldiv! (x,p. A,b)
161
161
elseif typeof (A) <: AbstractDiffEqOperator
162
162
# No good starting guess, so guess zero
0 commit comments