File tree 2 files changed +2
-2
lines changed
2 files changed +2
-2
lines changed Original file line number Diff line number Diff line change 1
1
name = " LinearSolve"
2
2
uuid = " 7ed4a6bd-45f5-4d41-b270-4a48e9bafcae"
3
3
authors = [" SciML" ]
4
- version = " 1.35 .0"
4
+ version = " 1.36 .0"
5
5
6
6
[deps ]
7
7
ArrayInterface = " 4fba245c-0d91-5ea0-9b3e-6abc04ee57a9"
Original file line number Diff line number Diff line change @@ -46,7 +46,7 @@ is what is called at `init` time to create the first `cacheval`. Note that this
46
46
should match the type of the cache later used in ` solve ` as many algorithms, like
47
47
those in OrdinaryDiffEq.jl, expect type-groundedness in the linear solver definitions.
48
48
While there are cheaper ways to obtain this type for LU factorizations (specifically,
49
- ` ArrayInterfaceCore .lu_instance(A)` ), for a demonstration, this just performs an
49
+ ` ArrayInterface .lu_instance(A)` ), for a demonstration, this just performs an
50
50
LU-factorization to get an ` LU{T, Matrix{T}} ` which it puts into the ` cacheval `
51
51
so it is typed for future use.
52
52
You can’t perform that action at this time.
0 commit comments