You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am currently procrastinating on my thesis by trying to update IntervalRootFinding.jl to the newest change in IntervalArithmetic.
It appears that some basics LinearAlgebra do not work.
In particular, det and inv or interval matrices use forbidden operations (isfinite and <). Would this package be a good place to have those ? IntervalRootFinding would then depend on IntervalLinearAlgebra (would make sense, we already have our own version of Gauss elimination for some reason.
sorry for the looooooooooooooooooooooooooooooooooooooooong delay, yes I think this is a good home for that! #98 has a refernce for the determinant computation algorithms I think underlying building blocks are already here.
For inv, I think this has already something maybe, but why do you need it? The only case where I can think one wants to compute inv is for preconditioning by the midpoint matrix, but in that case one needs not to compute a guaranteed enclosure, the idea is indeed to precondition the linear system with an approximate of the inverse midpoint matrix
I am currently procrastinating on my thesis by trying to update IntervalRootFinding.jl to the newest change in IntervalArithmetic.
It appears that some basics LinearAlgebra do not work.
In particular,
det
andinv
or interval matrices use forbidden operations (isfinite
and<
). Would this package be a good place to have those ? IntervalRootFinding would then depend on IntervalLinearAlgebra (would make sense, we already have our own version of Gauss elimination for some reason.@lucaferranti @OlivierHnt
The text was updated successfully, but these errors were encountered: