module Statistics.Matrix.Algorithms
(
qr
) where
import Control.Applicative ((<$>), (<*>))
import Control.Monad.ST (ST, runST)
import Prelude hiding (sum, replicate)
import Statistics.Matrix (Matrix, column, dimension, for, norm)
import qualified Statistics.Matrix.Mutable as M
import Statistics.Sample.Internal (sum)
import qualified Data.Vector.Unboxed as U
qr :: Matrix -> (Matrix, Matrix)
qr mat = runST $ do
let (m,n) = dimension mat
r <- M.replicate n n 0
a <- M.thaw mat
for 0 n $ \j -> do
cn <- M.immutably a $ \aa -> norm (column aa j)
M.unsafeWrite r j j cn
for 0 m $ \i -> M.unsafeModify a i j (/ cn)
for (j+1) n $ \jj -> do
p <- innerProduct a j jj
M.unsafeWrite r j jj p
for 0 m $ \i -> do
aij <- M.unsafeRead a i j
M.unsafeModify a i jj $ subtract (p * aij)
(,) <$> M.unsafeFreeze a <*> M.unsafeFreeze r
innerProduct :: M.MMatrix s -> Int -> Int -> ST s Double
innerProduct mmat j k = M.immutably mmat $ \mat ->
sum $ U.zipWith (*) (column mat j) (column mat k)