removed old examples

6 files changed, 0 insertions, 260 deletions

diff --git a/examples/experiments/bigtests.hs b/examples/experiments/bigtests.hs
deleted file mode 100644
index a3dfad2..0000000
--- a/examples/experiments/bigtests.hs
+++ /dev/null
@@ -1,60 +0,0 @@
-module Main where
-
-import Numeric.LinearAlgebra
-import Numeric.LinearAlgebra.Tests
-import System.Random(randomRs,mkStdGen)
-import Test.HUnit hiding (test)
-import System(getArgs)
-
-
-pseudorandomR seed (n,m) = reshape m $ fromList $ take (n*m) $ randomRs (-100,100) $ mkStdGen seed
-
-pseudorandomC seed (n,m) = toComplex (pseudorandomR seed (n,m), pseudorandomR (seed+1) (n,m))
-
-bigmat = m + trans m
-    where m = pseudorandomR 18 (1000,1000) :: Matrix Double
-bigmatc = mc + ctrans mc
-    where mc = pseudorandomC 19 (1000,1000) :: Matrix (Complex Double)
-
-utest str b = TestCase $ assertBool str b
-
-feye n = flipud (ident n) :: Matrix Double
-
-infixl 4 |~|
-a |~| b = dist a b < 10^^(-10)
-
-dist a b = r
-    where norm = pnorm Infinity
-          na = norm a
-          nb = norm b
-          nab = norm (a-b)
-          mx = max na nb
-          mn = min na nb
-          r = if mn < eps
-                then mx
-                else nab/mx
-
-square m = rows m == cols m
-
-unitary m = square m && m <> ctrans m |~| ident (rows m)
-
-eigProp m = complex m <> v |~| v <> diag s
-    where (s, v) = eig m
-
-eigSHProp m = m <> v |~| v <> real (diag s)
-              && unitary v
-              && m |~| v <> real (diag s) <> ctrans v
-    where (s, v) = eigSH m
-
-bigtests = do
-    putStrLn "--------- big matrices -----"
-    runTestTT $ TestList
-     [ utest "eigS" $ eigSHProp bigmat
-     , utest "eigH" $ eigSHProp bigmatc
-     , utest "eigR" $ eigProp   bigmat
-     , utest "eigC" $ eigProp   bigmatc
-     , utest "det"  $ det (feye 1000) == 1 && det (feye 1002) == -1
-     ]
-    return ()
-
-main = bigtests
diff --git a/examples/experiments/listlike.hs b/examples/experiments/listlike.hs
deleted file mode 100644
index 2d62447..0000000
--- a/examples/experiments/listlike.hs
+++ /dev/null
@@ -1,24 +0,0 @@
-{-# OPTIONS_GHC -fglasgow-exts #-}
-
-import qualified Data.ListLike as LL
-import Numeric.LinearAlgebra
-import Data.Monoid
-import Foreign
-
-instance Storable a => LL.FoldableLL (Vector a) a where
-    foldl f x v = foldl f x (toList v)
-    foldr f x v = foldr f x (toList v)
-
-instance Storable a => LL.ListLike (Vector a) a where
-    singleton a = fromList [a]
-    head a = a @> 0
-    tail a | dim a == 1 = mempty
-           | otherwise  = subVector 1 (dim a -1) a
-    genericLength = fromIntegral.dim
-
-
-v k = fromList [1..k] :: Vector Double
-
-f k = k+(3::Double)
-
-main = print $ (LL.map f [1..5] :: Vector Double)
\ No newline at end of file
diff --git a/examples/experiments/parallel.hs b/examples/experiments/parallel.hs
deleted file mode 100644
index dfbfd88..0000000
--- a/examples/experiments/parallel.hs
+++ /dev/null
@@ -1,36 +0,0 @@
-import System(getArgs)
-import Numeric.LinearAlgebra
-import Control.Parallel.Strategies
-import System.Time
-
-inParallel = parMap rwhnf id
-
-parMul p x y = fromBlocks [ inParallel ( map (x <>) ys ) ]
-    where ys = splitColumns p y
-
-
-main = do
-    n <- (read . head) `fmap` getArgs
-    let m = ident n :: Matrix Double
-    time $ print $ vectorMax $ takeDiag $ m <> m
-    time $ print $ vectorMax $ takeDiag $ parMul 2 m m
-    time $ print $ vectorMax $ takeDiag $ parMul 4 m m
-    time $ print $ vectorMax $ takeDiag $ parMul 8 m m
-
-time act = do
-    t0 <- getClockTime
-    act
-    t1 <- getClockTime
-    print $ tdSec $ normalizeTimeDiff $ diffClockTimes t1 t0
-
-splitColumns n m = splitColumns' (f n (cols m)) m
-    where
-    splitColumns' [] m = []
-    splitColumns' ((a,b):rest) m = subMatrix (0,a) (rows m, b-a+1) m : splitColumns' rest m
-
-    f :: Int -> Int -> [(Int,Int)]
-    f n c = zip ks (map pred $ tail ks)
-        where ks = map round $ toList $ linspace (fromIntegral n+1) (0,fromIntegral c)
-
-splitRowsAt p m    = (takeRows p m, dropRows p m)
-splitColumnsAt p m = (takeColumns p m, dropColumns p m)
diff --git a/examples/experiments/speed.hs b/examples/experiments/speed.hs
deleted file mode 100644
index 22d7220..0000000
--- a/examples/experiments/speed.hs
+++ /dev/null
@@ -1,90 +0,0 @@
-{- speed tests
-
-GNU-Octave (see speed.m in this folder):
-
-./speed.m
-  -0.017877255967426   0.000000000000000  -0.999840189089781
-   0.000000000000000   1.000000000000000   0.000000000000000
-   0.999840189089763   0.000000000000000  -0.017877255967417
-9.69 seconds
-
-Mathematica:
-
-rot[a_]:={{ Cos[a], 0, Sin[a]},
-          { 0,      1,      0},
-          { -Sin[a],0,Cos[a]}}//N
-
-test := Timing[
-    n = 100000;
-    angles = Range[0.,n-1]/(n-1);
-    Fold[Dot,IdentityMatrix[3],rot/@angles] // MatrixForm
-]
-
-2.08013 Second
-     {{\(-0.017877255967432837`\), "0.`", \(-0.9998401890898042`\)},
-      {"0.`", "1.`", "0.`"},
-      {"0.9998401890898042`", "0.`", \(-0.017877255967432837`\)}}
-
-$ ghc --make -O speed
-
-$ ./speed 5 100000 1
-(3><3)
- [ -1.7877255967425523e-2, 0.0,    -0.9998401890897632
- ,                    0.0, 1.0,                    0.0
- ,      0.999840189089781, 0.0, -1.7877255967416586e-2 ]
-0.33 CPU seconds
-
-cos 50000 = -0.0178772559665563
-sin 50000 = -0.999840189089790
-
--}
-
-import Numeric.LinearAlgebra
-import System
-import Data.List(foldl1')
-import System.CPUTime
-import Text.Printf
-import Debug.Trace
-
-debug x = trace (show x) x
-
-timing act = do
-    t0 <- getCPUTime
-    act
-    t1 <- getCPUTime
-    printf "%.2f CPU seconds\n" $ (fromIntegral ((t1 - t0) `div` (10^10)) / 100 :: Double) :: IO ()
-
-op a b = trans $ (trans a) <> (trans b)
-
-op2 a b = trans $ (trans a) + (trans b)
-
-rot' :: Double -> Matrix Double
-rot' a = matrix [[ c,0,s],
-                 [ 0,1,0],
-                 [-s,0,c]]
-    where c = cos a
-          s = sin a
-          matrix = fromLists
-
-rot :: Double -> Matrix Double
-rot a = (3><3) [ c,0,s
-               , 0,1,0
-               ,-s,0,c ]
-    where c = cos a
-          s = sin a
-
-fun n r = foldl1' (<>) (map r angles)
-    where angles = toList $ linspace n (0,1)
-
-main = do
-    args <- getArgs
-    let [p,n,d] = map read args
-    let ms = replicate n ((ident d :: Matrix Double))
-    let mz = replicate n (diag (constant (0::Double) d))
-    timing $ case p of
-        0 -> print $ foldl1' (<>) ms
-        1 -> print $ foldl1' (<>) (map trans ms)
-        2 -> print $ foldl1' op ms
-        3 -> print $ foldl1' op2 mz
-        4 -> print $ fun n rot'
-        5 -> print $ fun n rot
diff --git a/examples/experiments/speed.m b/examples/experiments/speed.m
deleted file mode 100644
index 2f41665..0000000
--- a/examples/experiments/speed.m
+++ /dev/null
@@ -1,21 +0,0 @@
-#! /usr/bin/octave -qf
-1; % measuring Octave computing times
-
-function r = rot(a)
-    c = cos(a);
-    s = sin(a);
-    r = [ c , 0, s;
-          0,  1, 0;
-         -s,  0, c];
-end
-
-t0=time();
-x = linspace(0,1,1E5);
-ac = eye(3);
-for a = x
-    ac = ac*rot(a);
-end
-
-format long
-disp(ac);
-printf("%.2f seconds\n",time()-t0)
diff --git a/examples/experiments/testmnist.m b/examples/experiments/testmnist.m
deleted file mode 100644
index 38625a7..0000000
--- a/examples/experiments/testmnist.m
+++ /dev/null
@@ -1,29 +0,0 @@
-#! /usr/bin/octave -qf
-% measuring Octave computing times
-
-t0=time();
-load mnist.txt
-disp("load");
-disp(time()-t0)
-
-
-x = mnist(:,1:784);
-d = mnist(:,785);
-
-
-t0=time();
-xc = x - repmat(mean(x),rows(x),1);
-disp("x - repmat(mean(x),rows(x),1)");
-disp(time()-t0)
-
-t0=time();
-mc = (xc'*xc)/rows(x);
-disp("(xc'*xc)/rows(x)");
-disp(time()-t0)
-
-t0=time();
-[v,l]=eig(mc);
-disp("eig");
-disp(time()-t0)
-
-disp(flipud(diag(l))(1:10));
\ No newline at end of file