We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
It looks like the current default algorithm will choose
LinearSolve.jl/src/default.jl
Line 185 in e712202
when an SMatrix from StaticArrays.jl is passed. For example,
SMatrix
julia> using LinearSolve, StaticArrays julia> A = @SMatrix [1.0 2.0; 3.0 4.0]; b = @SVector [1.0, 2.0]; prob = LinearProblem(A, b) LinearProblem. In-place: true b: 2-element SVector{2, Float64} with indices SOneTo(2): 1.0 2.0 julia> sol = solve(prob) retcode: Default u: 2-element Vector{Float64}: 1.966189735084803e-16 0.49999999999999994 julia> sol.alg LinearSolve.DefaultLinearSolver(LinearSolve.DefaultAlgorithmChoice.KrylovJL_GMRES)
It would be nice if LinearSolve.jl could handle StaticArrays.jl efficiently.
CC @SKopecz
The text was updated successfully, but these errors were encountered:
This was fixed by #436 . The PR was already there I just needed to review and merge 😅
Sorry, something went wrong.
Thanks!
No branches or pull requests
It looks like the current default algorithm will choose
LinearSolve.jl/src/default.jl
Line 185 in e712202
when an
SMatrix
from StaticArrays.jl is passed. For example,It would be nice if LinearSolve.jl could handle StaticArrays.jl efficiently.
CC @SKopecz
The text was updated successfully, but these errors were encountered: