2 files changed, 4 insertions, 54 deletions

diff --git a/packages/base/src/Numeric/LinearAlgebra.hs b/packages/base/src/Numeric/LinearAlgebra.hs
index 2e6b8ca..0b8abbb 100644
--- a/packages/base/src/Numeric/LinearAlgebra.hs
+++ b/packages/base/src/Numeric/LinearAlgebra.hs
@@ -77,10 +77,10 @@ module Numeric.LinearAlgebra (
     linearSolveLS,
     linearSolveSVD,
     luSolve,
+    luSolve',
     cholSolve,
     cgSolve,
     cgSolve',
-    linearSolve',
 
     -- * Inverse and pseudoinverse
     inv, pinv, pinvTol,
@@ -122,7 +122,7 @@ module Numeric.LinearAlgebra (
     schur,
 
     -- * LU
-    lu, luPacked, luFact, luPacked',
+    lu, luPacked, luPacked', luFact,
 
     -- * Matrix functions
     expm,
@@ -158,14 +158,13 @@ import Numeric.Vector()
 import Internal.Matrix
 import Internal.Container hiding ((<>))
 import Internal.Numeric hiding (mul)
-import Internal.Algorithms hiding (linearSolve,Normed,orth,luPacked',linearSolve')
+import Internal.Algorithms hiding (linearSolve,Normed,orth,luPacked',linearSolve',luSolve')
 import qualified Internal.Algorithms as A
 import Internal.Util
 import Internal.Random
 import Internal.Sparse((!#>))
 import Internal.CG
 import Internal.Conversion
-import Internal.ST(mutable)
 
 {- | infix synonym of 'mul'
 
@@ -240,53 +239,4 @@ nullspace m = nullspaceSVD (Left (1*eps)) m (rightSV m)
 -- | return an orthonormal basis of the range space of a matrix. See also 'orthSVD'.
 orth m = orthSVD (Left (1*eps)) m (leftSV m)
 
-{- | Experimental implementation of LU factorization
-     working on any Fractional element type, including 'Mod' n 'I' and 'Mod' n 'Z'.
-
->>> let m = ident 5 + (5><5) [0..] :: Matrix (Z ./. 17)
-(5><5)
- [  1,  1,  2,  3,  4
- ,  5,  7,  7,  8,  9
- , 10, 11, 13, 13, 14
- , 15, 16,  0,  2,  2
- ,  3,  4,  5,  6,  8 ]
-
->>> let (l,u,p,s) = luFact $ luPacked' m
->>> l
-(5><5)
- [  1,  0, 0,  0, 0
- ,  6,  1, 0,  0, 0
- , 12,  7, 1,  0, 0
- ,  7, 10, 7,  1, 0
- ,  8,  2, 6, 11, 1 ]
->>> u
-(5><5)
- [ 15, 16,  0,  2,  2
- ,  0, 13,  7, 13, 14
- ,  0,  0, 15,  0, 11
- ,  0,  0,  0, 15, 15
- ,  0,  0,  0,  0,  1 ]
-
--}
-luPacked' x = mutable (luST (magnit 0)) x
-
-{- | Experimental implementation of gaussian elimination
-     working on any Fractional element type, including 'Mod' n 'I' and 'Mod' n 'Z'.
-
->>> let a = (2><2) [1,2,3,5] :: Matrix (Z ./. 13)
-(2><2)
- [ 1, 2
- , 3, 5 ]
->>> b
-(2><3)
- [ 5, 1, 3
- , 8, 6, 3 ]
-
->>> let x = linearSolve' a b
-(2><3)
- [ 4,  7, 4
- , 7, 10, 6 ]
-
--}
-linearSolve' x y = gaussElim x y
 
diff --git a/packages/base/src/Numeric/LinearAlgebra/Devel.hs b/packages/base/src/Numeric/LinearAlgebra/Devel.hs
index 36c5f03..db4236b 100644
--- a/packages/base/src/Numeric/LinearAlgebra/Devel.hs
+++ b/packages/base/src/Numeric/LinearAlgebra/Devel.hs
@@ -43,7 +43,7 @@ module Numeric.LinearAlgebra.Devel(
     -- ** Mutable Matrices
     STMatrix, newMatrix, thawMatrix, freezeMatrix, runSTMatrix,
     readMatrix, writeMatrix, modifyMatrix, liftSTMatrix,
-    mutable, extractMatrix, setMatrix, rowOper, RowOper(..), RowRange(..), ColRange(..),
+    mutable, extractMatrix, setMatrix, rowOper, RowOper(..), RowRange(..), ColRange(..), gemmm, Slice(..),
     -- ** Unsafe functions
     newUndefinedVector,
     unsafeReadVector, unsafeWriteVector,