summaryrefslogtreecommitdiff
path: root/lib/Numeric/LinearAlgebra/Algorithms.hs
diff options
context:
space:
mode:
Diffstat (limited to 'lib/Numeric/LinearAlgebra/Algorithms.hs')
-rw-r--r--lib/Numeric/LinearAlgebra/Algorithms.hs18
1 files changed, 1 insertions, 17 deletions
diff --git a/lib/Numeric/LinearAlgebra/Algorithms.hs b/lib/Numeric/LinearAlgebra/Algorithms.hs
index 9ae5e32..6500e0b 100644
--- a/lib/Numeric/LinearAlgebra/Algorithms.hs
+++ b/lib/Numeric/LinearAlgebra/Algorithms.hs
@@ -74,8 +74,7 @@ module Numeric.LinearAlgebra.Algorithms (
74 haussholder, 74 haussholder,
75 unpackQR, unpackHess, 75 unpackQR, unpackHess,
76 pinvTol, 76 pinvTol,
77 ranksv, 77 ranksv
78 full, economy
79) where 78) where
80 79
81 80
@@ -216,21 +215,6 @@ leftSV m | vertical m = let (u,s,_) = svd m in (u,s)
216 | otherwise = let (u,s,_) = thinSVD m in (u,s) 215 | otherwise = let (u,s,_) = thinSVD m in (u,s)
217 216
218 217
219{-# DEPRECATED full "use fullSVD instead" #-}
220full svdFun m = (u, d ,v) where
221 (u,s,v) = svdFun m
222 d = diagRect 0 s r c
223 r = rows m
224 c = cols m
225
226{-# DEPRECATED economy "use compactSVD instead" #-}
227economy svdFun m = (u', subVector 0 d s, v') where
228 (u,s,v) = svdFun m
229 d = rankSVD (1*eps) m s `max` 1
230 u' = takeColumns d u
231 v' = takeColumns d v
232
233
234-------------------------------------------------------------- 218--------------------------------------------------------------
235 219
236-- | Obtains the LU decomposition of a matrix in a compact data structure suitable for 'luSolve'. 220-- | Obtains the LU decomposition of a matrix in a compact data structure suitable for 'luSolve'.