sparse-linear-algebra
sparse-linear-algebra copied to clipboard
ocramz
Numerical computation in native Haskell
I've got a specific case where a cholesky decomposition fails (gets an NaN in the result) using sparse-linear-algebra but succeeds in hmatrix. I believe hmatrix is correct. I've replicated the...
This should be fairly trivial (other than the Floating requirement): ``` nearZero 0 = True nearZero _ = False ```
`(#~#^)` should be A B^T and vice versa for `(#~^#)`. The documentation and function is above anb below the wrong type signature in each one respectively. Solution is to swap...
Is `imapSM` intended to have its function argument as `(\col row val -> ...)`? I would think it should be `(\row col val -> ...)`. For example, this to me...
When inputting a very large matrix into my program, the majority of the time spent is reading (attoparsec from `matrix-market-attoparsec`) and matrix creation (the IntM functions). Is there a way...
This may be more question than issue. I understand why post-sparsifying might be the best route to making the matrix-matrix product sparse. But, in the regular product, why not leave...
The `Elt` class includes `Float`s, while they `PrintDense` class works only for things over `Double`s. This means that some functions, like `lu`, which requires only `Elt`s, work for matrices of...
References : * algorithmic discussion at http://bwlewis.github.io/GLM/ * GLMNET R vignette : https://web.stanford.edu/~hastie/glmnet/glmnet_alpha.html
``` Prelude Data.Sparse.Common> x = (fromListSV 4 [(2,3)] :: SpVector Double) Prelude Data.Sparse.Common> y = (fromListSV 4 [(0,3)] :: SpVector Double) Prelude Data.Sparse.Common> fromRowsL [x, y] *** Exception: insertRowSM :...
From https://github.com/JuliaMath/IterativeSolvers.jl/issues/1 A comprehensive listing of methods in the references. Please remove any methods are impractical/obsolete and add methods worth implementing to the list. Linear systems - Stationary methods -...