diff --git a/ext/LinearSolveSparseArraysExt.jl b/ext/LinearSolveSparseArraysExt.jl index a0eb393ed..6a8aa639b 100644 --- a/ext/LinearSolveSparseArraysExt.jl +++ b/ext/LinearSolveSparseArraysExt.jl @@ -15,7 +15,7 @@ LinearSolve.issparsematrix(A::AbstractSparseArray) = true function LinearSolve.make_SparseMatrixCSC(A::AbstractSparseArray) SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A), nonzeros(A)) end -function LinearSolve.makeempty_SparaseMatrixCSC(A::AbstractSparseArray) +function LinearSolve.makeempty_SparseMatrixCSC(A::AbstractSparseArray) SparseMatrixCSC(0, 0, [1], Int[], eltype(A)[]) end diff --git a/src/LinearSolve.jl b/src/LinearSolve.jl index c66e3c1b9..66dc0bafc 100644 --- a/src/LinearSolve.jl +++ b/src/LinearSolve.jl @@ -92,7 +92,7 @@ issparsematrixcsc(A) = false handle_sparsematrixcsc_lu(A) = lu(A) issparsematrix(A) = false make_SparseMatrixCSC(A) = nothing -makeempty_SparaseMatrixCSC(A) = nothing +makeempty_SparseMatrixCSC(A) = nothing EnumX.@enumx DefaultAlgorithmChoice begin LUFactorization diff --git a/src/iterative_wrappers.jl b/src/iterative_wrappers.jl index e7bdf30c1..398f981a7 100644 --- a/src/iterative_wrappers.jl +++ b/src/iterative_wrappers.jl @@ -196,7 +196,7 @@ function init_cacheval(alg::KrylovJL, A, b, u, Pl, Pr, maxiters::Int, abstol, re alg.KrylovAlg === Krylov.gpmr! || alg.KrylovAlg === Krylov.fom!) if issparsematrixcsc(A) - KS(makeempty_SparaseMatrixCSC(A), eltype(b)[], 1) + KS(makeempty_SparseMatrixCSC(A), eltype(b)[], 1) elseif A isa Matrix KS(Matrix{eltype(A)}(undef, 0, 0), eltype(b)[], 1) else @@ -204,7 +204,7 @@ function init_cacheval(alg::KrylovJL, A, b, u, Pl, Pr, maxiters::Int, abstol, re end else if issparsematrixcsc(A) - KS(makeempty_SparaseMatrixCSC(A), eltype(b)[]) + KS(makeempty_SparseMatrixCSC(A), eltype(b)[]) elseif A isa Matrix KS(Matrix{eltype(A)}(undef, 0, 0), eltype(b)[]) else