- -- The second argument to lambda should always be zero here, so we
- -- ignore it.
- lambda :: Int -> Int -> a
- lambda k _
- | k == n = (b k) / (m k k)
- | otherwise = ((b k) - sum [ (m k j) NP.* (x j) |
- j <- [k+1..n] ]) / (m k k)
- where
- n = (ncols m') - 1
+ f :: Int -> Int -> Col (S m) a -> (a, a) -> Col (S m) a
+ f i _ x (mii, bi) = set_idx x (i,0) newval
+ where
+ newval = (bi - (x `dot` (transpose $ row matrix i))) / mii